./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-23 00:09:18,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 00:09:18,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 00:09:18,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 00:09:18,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 00:09:18,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 00:09:18,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 00:09:18,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 00:09:18,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 00:09:18,412 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 00:09:18,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 00:09:18,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 00:09:18,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 00:09:18,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 00:09:18,414 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 00:09:18,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 00:09:18,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 00:09:18,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 00:09:18,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 00:09:18,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 00:09:18,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 00:09:18,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 00:09:18,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 00:09:18,416 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 00:09:18,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 00:09:18,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 00:09:18,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 00:09:18,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 00:09:18,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:09:18,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 00:09:18,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 00:09:18,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 00:09:18,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 00:09:18,420 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-23 00:09:18,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 00:09:18,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 00:09:18,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 00:09:18,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 00:09:18,669 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 00:09:18,669 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-23 00:09:19,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 00:09:20,096 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 00:09:20,096 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-23 00:09:20,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3e64bd3/587712a54bdb402094430f69583b088c/FLAGf7ff87793 [2023-11-23 00:09:20,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3e64bd3/587712a54bdb402094430f69583b088c [2023-11-23 00:09:20,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 00:09:20,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 00:09:20,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 00:09:20,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 00:09:20,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 00:09:20,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:20" (1/1) ... [2023-11-23 00:09:20,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c58b131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:20, skipping insertion in model container [2023-11-23 00:09:20,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:20" (1/1) ... [2023-11-23 00:09:20,290 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 00:09:23,365 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-23 00:09:23,372 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-23 00:09:23,377 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-23 00:09:23,381 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-23 00:09:23,385 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-23 00:09:23,389 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-23 00:09:23,393 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-23 00:09:23,397 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-23 00:09:23,401 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-23 00:09:23,407 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-23 00:09:23,411 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-23 00:09:23,416 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-23 00:09:23,421 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-23 00:09:23,427 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-23 00:09:23,431 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-23 00:09:23,435 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-23 00:09:23,439 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-23 00:09:23,443 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-23 00:09:23,448 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-23 00:09:23,452 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-23 00:09:23,456 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-23 00:09:23,459 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-23 00:09:23,463 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-23 00:09:23,467 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-23 00:09:23,471 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-23 00:09:23,475 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-23 00:09:23,479 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-23 00:09:23,483 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-23 00:09:23,487 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-23 00:09:23,491 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-23 00:09:23,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:09:23,514 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 00:09:23,627 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-23 00:09:23,630 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-23 00:09:23,630 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7360] [2023-11-23 00:09:23,631 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-23 00:09:23,632 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-23 00:09:23,634 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-23 00:09:23,634 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-23 00:09:23,641 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-23 00:09:23,642 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-23 00:09:23,643 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-23 00:09:23,643 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-23 00:09:23,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8255] [2023-11-23 00:09:23,820 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-23 00:09:23,820 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-23 00:09:23,820 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-23 00:09:23,820 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-23 00:09:23,821 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-23 00:09:23,821 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-23 00:09:23,824 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-23 00:09:23,824 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-23 00:09:23,825 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-23 00:09:23,826 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-23 00:09:23,826 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-23 00:09:23,826 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-23 00:09:23,826 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-23 00:09:23,827 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-23 00:09:23,827 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-23 00:09:23,961 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-23 00:09:23,961 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-23 00:09:23,962 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-23 00:09:23,962 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-23 00:09:23,962 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-23 00:09:23,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[486357,486370] [2023-11-23 00:09:23,964 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-23 00:09:23,964 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-23 00:09:23,965 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-23 00:09:23,965 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-23 00:09:23,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[488574,488587] [2023-11-23 00:09:23,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-23 00:09:23,967 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-23 00:09:23,967 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-23 00:09:23,968 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-23 00:09:23,968 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-23 00:09:23,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[492159,492172] [2023-11-23 00:09:23,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[492995,493008] [2023-11-23 00:09:23,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[494341,494354] [2023-11-23 00:09:23,970 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-23 00:09:23,971 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-23 00:09:23,971 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-23 00:09:23,971 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-23 00:09:23,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[496869,496882] [2023-11-23 00:09:23,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[497782,497795] [2023-11-23 00:09:23,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[498173,498186] [2023-11-23 00:09:23,973 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-23 00:09:23,973 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-23 00:09:23,973 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-23 00:09:23,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[500072,500085] [2023-11-23 00:09:23,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:09:24,191 WARN L675 CHandler]: The function debug_dma_sync_single_for_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,191 WARN L675 CHandler]: The function atm_charge is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,191 WARN L675 CHandler]: The function debug_dma_alloc_coherent is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,191 WARN L675 CHandler]: The function kfree is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function __raw_spin_lock_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function free_irq is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function debug_dma_map_page is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function might_fault is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function tasklet_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function printk is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function warn_slowpath_null is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,192 WARN L675 CHandler]: The function dma_set_mask is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,193 WARN L675 CHandler]: The function capable is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,193 WARN L675 CHandler]: The function pci_enable_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,193 WARN L675 CHandler]: The function __const_udelay is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,193 WARN L675 CHandler]: The function ldv_pre_probe is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,193 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,194 WARN L675 CHandler]: The function skb_put is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,194 WARN L675 CHandler]: The function __pci_register_driver is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,194 WARN L675 CHandler]: The function pci_disable_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,194 WARN L675 CHandler]: The function msecs_to_jiffies is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,195 WARN L675 CHandler]: The function pci_unregister_driver is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,195 WARN L675 CHandler]: The function __mutex_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,195 WARN L675 CHandler]: The function _copy_to_user is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,195 WARN L675 CHandler]: The function request_firmware is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,195 WARN L675 CHandler]: The function pci_set_master is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function _raw_spin_unlock_irqrestore is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function __copy_to_user_overflow is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function __phys_addr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function ldv_after_alloc is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function ldv_assert is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function debug_dma_sync_single_for_cpu is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,196 WARN L675 CHandler]: The function __ldv_linux_kernel_locking_spinlock_spin_lock is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,197 WARN L675 CHandler]: The function atm_dev_register is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,197 WARN L675 CHandler]: The function release_firmware is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,197 WARN L675 CHandler]: The function dma_supported is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,197 WARN L675 CHandler]: The function __tasklet_schedule is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,197 WARN L675 CHandler]: The function pci_bus_write_config_byte is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function panic is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function debug_dma_free_coherent is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function pci_bus_read_config_byte is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function ktime_get_with_offset is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function __dev_kfree_skb_any is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function request_threaded_irq is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function debug_dma_unmap_page is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,198 WARN L675 CHandler]: The function atm_dev_deregister is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 00:09:24,204 INFO L206 MainTranslator]: Completed translation [2023-11-23 00:09:24,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24 WrapperNode [2023-11-23 00:09:24,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 00:09:24,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 00:09:24,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 00:09:24,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 00:09:24,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,436 INFO L138 Inliner]: procedures = 699, calls = 2855, calls flagged for inlining = 266, calls inlined = 176, statements flattened = 6101 [2023-11-23 00:09:24,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 00:09:24,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 00:09:24,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 00:09:24,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 00:09:24,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 00:09:24,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 00:09:24,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 00:09:24,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 00:09:24,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (1/1) ... [2023-11-23 00:09:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:09:24,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:09:24,719 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-23 00:09:24,742 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-23 00:09:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2023-11-23 00:09:24,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2023-11-23 00:09:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2023-11-23 00:09:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2023-11-23 00:09:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2023-11-23 00:09:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2023-11-23 00:09:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 00:09:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-23 00:09:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 00:09:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-23 00:09:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2023-11-23 00:09:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2023-11-23 00:09:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-23 00:09:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-23 00:09:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2023-11-23 00:09:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2023-11-23 00:09:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_net_sock [2023-11-23 00:09:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_net_sock [2023-11-23 00:09:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2023-11-23 00:09:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 00:09:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 00:09:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2023-11-23 00:09:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2023-11-23 00:09:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 00:09:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-23 00:09:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2023-11-23 00:09:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2023-11-23 00:09:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2023-11-23 00:09:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure dma_set_mask [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2023-11-23 00:09:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 00:09:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_arch_io [2023-11-23 00:09:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_arch_io [2023-11-23 00:09:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-23 00:09:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-23 00:09:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-23 00:09:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-23 00:09:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-23 00:09:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-23 00:09:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 00:09:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-23 00:09:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 00:09:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-23 00:09:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-23 00:09:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure dma_supported [2023-11-23 00:09:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2023-11-23 00:09:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2023-11-23 00:09:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2023-11-23 00:09:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2023-11-23 00:09:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-23 00:09:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-23 00:09:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-23 00:09:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_alloc_irq [2023-11-23 00:09:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_alloc_irq [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock [2023-11-23 00:09:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2023-11-23 00:09:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2023-11-23 00:09:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2023-11-23 00:09:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-23 00:09:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_free_coherent [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-23 00:09:24,760 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2023-11-23 00:09:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-23 00:09:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-23 00:09:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-23 00:09:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 00:09:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-23 00:09:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2023-11-23 00:09:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2023-11-23 00:09:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 00:09:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-23 00:09:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 00:09:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_queue [2023-11-23 00:09:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_queue [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-23 00:09:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-23 00:09:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2023-11-23 00:09:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2023-11-23 00:09:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 00:09:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-23 00:09:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-23 00:09:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-23 00:09:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-23 00:09:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-23 00:09:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_mutex [2023-11-23 00:09:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_mutex [2023-11-23 00:09:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2023-11-23 00:09:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2023-11-23 00:09:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 00:09:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-23 00:09:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2023-11-23 00:09:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_spinlock [2023-11-23 00:09:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_spinlock [2023-11-23 00:09:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 00:09:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-23 00:09:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_genhd [2023-11-23 00:09:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_genhd [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock_sched [2023-11-23 00:09:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock_sched [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2023-11-23 00:09:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-23 00:09:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-23 00:09:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 00:09:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 00:09:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-23 00:09:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-23 00:09:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2023-11-23 00:09:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2023-11-23 00:09:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2023-11-23 00:09:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2023-11-23 00:09:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2023-11-23 00:09:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2023-11-23 00:09:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2023-11-23 00:09:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2023-11-23 00:09:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 00:09:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-23 00:09:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2023-11-23 00:09:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-23 00:09:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2023-11-23 00:09:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2023-11-23 00:09:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure __pci_register_driver [2023-11-23 00:09:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 00:09:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 00:09:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2023-11-23 00:09:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-23 00:09:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2023-11-23 00:09:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2023-11-23 00:09:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2023-11-23 00:09:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2023-11-23 00:09:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 00:09:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 00:09:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_sync_single_for_device [2023-11-23 00:09:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2023-11-23 00:09:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2023-11-23 00:09:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2023-11-23 00:09:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2023-11-23 00:09:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 00:09:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock_bh [2023-11-23 00:09:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock_bh [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unregister_driver [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 00:09:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_sync_single_for_cpu [2023-11-23 00:09:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2023-11-23 00:09:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2023-11-23 00:09:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2023-11-23 00:09:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2023-11-23 00:09:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 00:09:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-23 00:09:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2023-11-23 00:09:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2023-11-23 00:09:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 00:09:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2023-11-23 00:09:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_register [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 00:09:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_alloc_usb_lock [2023-11-23 00:09:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_alloc_usb_lock [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-23 00:09:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-23 00:09:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2023-11-23 00:09:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_alloc_coherent [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_fs_sysfs [2023-11-23 00:09:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_fs_sysfs [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 00:09:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2023-11-23 00:09:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2023-11-23 00:09:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 00:09:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_coherent [2023-11-23 00:09:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_coherent [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 00:09:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2023-11-23 00:09:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_rwlock [2023-11-23 00:09:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_rwlock [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2023-11-23 00:09:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 00:09:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2023-11-23 00:09:24,776 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2023-11-23 00:09:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_drivers_base_class [2023-11-23 00:09:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_drivers_base_class [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-23 00:09:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_module [2023-11-23 00:09:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_module [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2023-11-23 00:09:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2023-11-23 00:09:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 00:09:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-23 00:09:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 00:09:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure __dev_kfree_skb_any [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-23 00:09:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-23 00:09:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2023-11-23 00:09:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2023-11-23 00:09:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2023-11-23 00:09:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2023-11-23 00:09:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 00:09:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-23 00:09:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 00:09:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-23 00:09:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 00:09:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-23 00:09:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 00:09:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_fs_char_dev [2023-11-23 00:09:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_fs_char_dev [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure pci_bus_write_config_byte [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-23 00:09:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-23 00:09:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2023-11-23 00:09:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2023-11-23 00:09:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_gadget [2023-11-23 00:09:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_gadget [2023-11-23 00:09:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 00:09:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-23 00:09:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 00:09:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_net_rtnetlink [2023-11-23 00:09:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_net_rtnetlink [2023-11-23 00:09:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 00:09:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2023-11-23 00:09:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 00:09:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2023-11-23 00:09:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-23 00:09:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-23 00:09:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_request [2023-11-23 00:09:24,783 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_request [2023-11-23 00:09:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 00:09:24,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-23 00:09:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-23 00:09:24,783 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-23 00:09:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2023-11-23 00:09:24,783 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2023-11-23 00:09:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_lib_idr [2023-11-23 00:09:24,783 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_lib_idr [2023-11-23 00:09:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2023-11-23 00:09:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2023-11-23 00:09:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2023-11-23 00:09:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_urb [2023-11-23 00:09:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_urb [2023-11-23 00:09:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2023-11-23 00:09:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2023-11-23 00:09:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 00:09:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2023-11-23 00:09:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-23 00:09:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_deregister [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 00:09:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_mmc_sdio_func [2023-11-23 00:09:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_mmc_sdio_func [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2023-11-23 00:09:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2023-11-23 00:09:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2023-11-23 00:09:24,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 00:09:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2023-11-23 00:09:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 00:09:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure pci_bus_read_config_byte [2023-11-23 00:09:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 00:09:24,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-23 00:09:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure request_threaded_irq [2023-11-23 00:09:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_srcu [2023-11-23 00:09:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_srcu [2023-11-23 00:09:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2023-11-23 00:09:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2023-11-23 00:09:25,506 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 00:09:25,510 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 00:09:28,926 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 00:09:29,064 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 00:09:29,065 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 00:09:29,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:29 BoogieIcfgContainer [2023-11-23 00:09:29,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 00:09:29,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 00:09:29,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 00:09:29,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 00:09:29,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:20" (1/3) ... [2023-11-23 00:09:29,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e00be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:29, skipping insertion in model container [2023-11-23 00:09:29,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:24" (2/3) ... [2023-11-23 00:09:29,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e00be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:29, skipping insertion in model container [2023-11-23 00:09:29,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:29" (3/3) ... [2023-11-23 00:09:29,071 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c [2023-11-23 00:09:29,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 00:09:29,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-23 00:09:29,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 00:09:29,143 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;@30c12076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 00:09:29,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-23 00:09:29,151 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-23 00:09:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 00:09:29,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:09:29,170 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-23 00:09:29,170 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-23 00:09:29,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:09:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 496120257, now seen corresponding path program 1 times [2023-11-23 00:09:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:09:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018173134] [2023-11-23 00:09:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:09:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:09:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:09:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:09:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:09:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:09:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:09:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:09:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:09:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:30,043 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-23 00:09:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:09:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018173134] [2023-11-23 00:09:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018173134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:09:30,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:09:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 00:09:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525946257] [2023-11-23 00:09:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:09:30,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:09:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:09:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:09:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:09:30,075 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-23 00:09:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:09:36,051 INFO L93 Difference]: Finished difference Result 3375 states and 5047 transitions. [2023-11-23 00:09:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 00:09:36,053 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-23 00:09:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:09:36,114 INFO L225 Difference]: With dead ends: 3375 [2023-11-23 00:09:36,114 INFO L226 Difference]: Without dead ends: 1667 [2023-11-23 00:09:36,126 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-23 00:09:36,130 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2550 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 1660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:09:36,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 495 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1660 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-23 00:09:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-11-23 00:09:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2023-11-23 00:09:36,349 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-23 00:09:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2334 transitions. [2023-11-23 00:09:36,358 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2334 transitions. Word has length 52 [2023-11-23 00:09:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:09:36,359 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2334 transitions. [2023-11-23 00:09:36,359 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-23 00:09:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2334 transitions. [2023-11-23 00:09:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 00:09:36,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:09:36,361 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-23 00:09:36,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 00:09:36,361 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-23 00:09:36,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:09:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 350155329, now seen corresponding path program 1 times [2023-11-23 00:09:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:09:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374879905] [2023-11-23 00:09:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:09:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:09:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:09:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:09:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:09:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:09:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:09:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:09:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:09:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:36,817 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-23 00:09:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:09:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374879905] [2023-11-23 00:09:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374879905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:09:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:09:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:09:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309471617] [2023-11-23 00:09:36,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:09:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:09:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:09:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:09:36,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:09:36,821 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-23 00:09:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:09:47,921 INFO L93 Difference]: Finished difference Result 3318 states and 4674 transitions. [2023-11-23 00:09:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 00:09:47,922 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-23 00:09:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:09:47,935 INFO L225 Difference]: With dead ends: 3318 [2023-11-23 00:09:47,936 INFO L226 Difference]: Without dead ends: 3315 [2023-11-23 00:09:47,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-23 00:09:47,938 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 6226 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 7253 mSolverCounterSat, 3801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6311 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 11054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3801 IncrementalHoareTripleChecker+Valid, 7253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:09:47,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6311 Valid, 948 Invalid, 11054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3801 Valid, 7253 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-11-23 00:09:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2023-11-23 00:09:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3120. [2023-11-23 00:09:48,048 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-23 00:09:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4464 transitions. [2023-11-23 00:09:48,062 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4464 transitions. Word has length 52 [2023-11-23 00:09:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:09:48,063 INFO L495 AbstractCegarLoop]: Abstraction has 3120 states and 4464 transitions. [2023-11-23 00:09:48,063 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-23 00:09:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4464 transitions. [2023-11-23 00:09:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 00:09:48,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:09:48,065 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-23 00:09:48,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 00:09:48,065 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-23 00:09:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:09:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -247361317, now seen corresponding path program 1 times [2023-11-23 00:09:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:09:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586397914] [2023-11-23 00:09:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:09:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:09:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:09:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:09:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:09:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:09:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:09:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:09:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:09:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:09:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:48,584 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-23 00:09:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:09:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586397914] [2023-11-23 00:09:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586397914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:09:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:09:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:09:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428353574] [2023-11-23 00:09:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:09:48,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:09:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:09:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:09:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:09:48,586 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-23 00:09:50,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:09:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:09:55,477 INFO L93 Difference]: Finished difference Result 3120 states and 4464 transitions. [2023-11-23 00:09:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:09:55,478 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-23 00:09:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:09:55,489 INFO L225 Difference]: With dead ends: 3120 [2023-11-23 00:09:55,489 INFO L226 Difference]: Without dead ends: 3117 [2023-11-23 00:09:55,490 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-23 00:09:55,493 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4037 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 2377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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, 6.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:09:55,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 680 Invalid, 6823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2377 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-23 00:09:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2023-11-23 00:09:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3117. [2023-11-23 00:09:55,594 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-23 00:09:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4461 transitions. [2023-11-23 00:09:55,605 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4461 transitions. Word has length 57 [2023-11-23 00:09:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:09:55,607 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4461 transitions. [2023-11-23 00:09:55,607 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-23 00:09:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4461 transitions. [2023-11-23 00:09:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-23 00:09:55,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:09:55,611 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-23 00:09:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 00:09:55,611 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-23 00:09:55,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:09:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1822251989, now seen corresponding path program 1 times [2023-11-23 00:09:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:09:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353368139] [2023-11-23 00:09:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:09:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:09:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:09:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:09:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:09:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:09:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:09:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:09:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:09:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:09:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:09:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:09:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:09:56,004 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-23 00:09:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:09:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353368139] [2023-11-23 00:09:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353368139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:09:56,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:09:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:09:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568705196] [2023-11-23 00:09:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:09:56,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:09:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:09:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:09:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:09:56,007 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-23 00:09:59,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:10:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:10:03,756 INFO L93 Difference]: Finished difference Result 3117 states and 4461 transitions. [2023-11-23 00:10:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:10:03,757 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-23 00:10:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:10:03,769 INFO L225 Difference]: With dead ends: 3117 [2023-11-23 00:10:03,769 INFO L226 Difference]: Without dead ends: 3114 [2023-11-23 00:10:03,770 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-23 00:10:03,771 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4031 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4440 mSolverCounterSat, 2374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s 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-23 00:10:03,771 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-23 00:10:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2023-11-23 00:10:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2023-11-23 00:10:03,905 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-23 00:10:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4458 transitions. [2023-11-23 00:10:03,914 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4458 transitions. Word has length 62 [2023-11-23 00:10:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:10:03,915 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4458 transitions. [2023-11-23 00:10:03,916 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-23 00:10:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4458 transitions. [2023-11-23 00:10:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 00:10:03,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:10:03,918 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-23 00:10:03,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 00:10:03,919 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-23 00:10:03,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:10:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1635153526, now seen corresponding path program 1 times [2023-11-23 00:10:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:10:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276744620] [2023-11-23 00:10:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:10:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:10:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:10:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:10:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:10:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:10:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:10:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:10:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:10:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:10:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:10:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:10:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:04,346 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-23 00:10:04,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:10:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276744620] [2023-11-23 00:10:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276744620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:10:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:10:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:10:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356192638] [2023-11-23 00:10:04,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:10:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:10:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:10:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:10:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:10:04,349 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-23 00:10:06,366 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-23 00:10:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:10:12,793 INFO L93 Difference]: Finished difference Result 3114 states and 4458 transitions. [2023-11-23 00:10:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:10:12,793 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-23 00:10:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:10:12,805 INFO L225 Difference]: With dead ends: 3114 [2023-11-23 00:10:12,805 INFO L226 Difference]: Without dead ends: 3111 [2023-11-23 00:10:12,806 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-23 00:10:12,807 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4025 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 2371 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 4433 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-23 00:10:12,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 680 Invalid, 6805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2371 Valid, 4433 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-11-23 00:10:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2023-11-23 00:10:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2023-11-23 00:10:12,909 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-23 00:10:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4455 transitions. [2023-11-23 00:10:12,918 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4455 transitions. Word has length 67 [2023-11-23 00:10:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:10:12,919 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 4455 transitions. [2023-11-23 00:10:12,920 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-23 00:10:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4455 transitions. [2023-11-23 00:10:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-23 00:10:12,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:10:12,921 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-23 00:10:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 00:10:12,921 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-23 00:10:12,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:10:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 636845406, now seen corresponding path program 1 times [2023-11-23 00:10:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:10:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112870112] [2023-11-23 00:10:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:10:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:10:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:10:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:10:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:10:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:10:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:10:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:10:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:10:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:10:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:10:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:10:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:13,329 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-23 00:10:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:10:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112870112] [2023-11-23 00:10:13,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112870112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:10:13,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:10:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:10:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82089498] [2023-11-23 00:10:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:10:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:10:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:10:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:10:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:10:13,331 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-23 00:10:14,811 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-23 00:10:16,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:10:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:10:21,287 INFO L93 Difference]: Finished difference Result 3111 states and 4455 transitions. [2023-11-23 00:10:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:10:21,288 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-23 00:10:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:10:21,298 INFO L225 Difference]: With dead ends: 3111 [2023-11-23 00:10:21,298 INFO L226 Difference]: Without dead ends: 3108 [2023-11-23 00:10:21,299 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-23 00:10:21,299 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4019 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4428 mSolverCounterSat, 2368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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.8s IncrementalHoareTripleChecker+Time [2023-11-23 00:10:21,300 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.8s Time] [2023-11-23 00:10:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2023-11-23 00:10:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2023-11-23 00:10:21,425 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-23 00:10:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4452 transitions. [2023-11-23 00:10:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4452 transitions. Word has length 72 [2023-11-23 00:10:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:10:21,435 INFO L495 AbstractCegarLoop]: Abstraction has 3108 states and 4452 transitions. [2023-11-23 00:10:21,436 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-23 00:10:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4452 transitions. [2023-11-23 00:10:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 00:10:21,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:10:21,438 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-23 00:10:21,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 00:10:21,439 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-23 00:10:21,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:10:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash 604681482, now seen corresponding path program 1 times [2023-11-23 00:10:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:10:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237363156] [2023-11-23 00:10:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:10:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:10:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:10:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:10:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:10:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:10:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:10:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:10:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:10:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 00:10:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 00:10:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:10:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:10:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 00:10:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:22,816 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-23 00:10:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:10:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237363156] [2023-11-23 00:10:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237363156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 00:10:22,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573966542] [2023-11-23 00:10:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:10:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:10:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:10:22,820 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-23 00:10:22,821 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-23 00:10:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:23,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 00:10:23,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:10:23,838 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-23 00:10:23,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:10:23,976 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-23 00:10:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573966542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 00:10:23,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 00:10:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 18 [2023-11-23 00:10:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030453965] [2023-11-23 00:10:23,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 00:10:23,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 00:10:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:10:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 00:10:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-11-23 00:10:23,979 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-23 00:10:25,435 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-23 00:10:29,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:10:30,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:10:33,252 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-23 00:10:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:10:52,145 INFO L93 Difference]: Finished difference Result 6354 states and 9199 transitions. [2023-11-23 00:10:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 00:10:52,146 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-23 00:10:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:10:52,163 INFO L225 Difference]: With dead ends: 6354 [2023-11-23 00:10:52,163 INFO L226 Difference]: Without dead ends: 3257 [2023-11-23 00:10:52,172 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-23 00:10:52,173 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 3191 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 27085 mSolverCounterSat, 2424 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3210 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 29510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2424 IncrementalHoareTripleChecker+Valid, 27085 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2023-11-23 00:10:52,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3210 Valid, 2670 Invalid, 29510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2424 Valid, 27085 Invalid, 1 Unknown, 0 Unchecked, 27.6s Time] [2023-11-23 00:10:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2023-11-23 00:10:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3129. [2023-11-23 00:10:52,346 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-23 00:10:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4478 transitions. [2023-11-23 00:10:52,355 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4478 transitions. Word has length 82 [2023-11-23 00:10:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:10:52,356 INFO L495 AbstractCegarLoop]: Abstraction has 3129 states and 4478 transitions. [2023-11-23 00:10:52,356 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-23 00:10:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4478 transitions. [2023-11-23 00:10:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 00:10:52,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:10:52,357 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-23 00:10:52,390 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-23 00:10:52,600 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-23 00:10:52,601 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-23 00:10:52,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:10:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2136620505, now seen corresponding path program 1 times [2023-11-23 00:10:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:10:52,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684920524] [2023-11-23 00:10:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:10:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:10:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:10:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:10:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:10:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:10:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:10:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:10:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:10:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:10:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:10:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:10:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:10:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:10:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:10:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:10:52,989 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-23 00:10:52,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:10:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684920524] [2023-11-23 00:10:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684920524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:10:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:10:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:10:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012860205] [2023-11-23 00:10:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:10:52,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:10:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:10:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:10:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:10:52,991 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-23 00:10:55,009 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-23 00:10:57,207 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-23 00:11:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:01,960 INFO L93 Difference]: Finished difference Result 3129 states and 4478 transitions. [2023-11-23 00:11:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:11:01,963 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-23 00:11:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:01,974 INFO L225 Difference]: With dead ends: 3129 [2023-11-23 00:11:01,975 INFO L226 Difference]: Without dead ends: 3126 [2023-11-23 00:11:01,976 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-23 00:11:01,976 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 4005 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 4409 mSolverCounterSat, 2355 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 6765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 4409 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-23 00:11:01,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 662 Invalid, 6765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2355 Valid, 4409 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2023-11-23 00:11:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2023-11-23 00:11:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3126. [2023-11-23 00:11:02,130 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-23 00:11:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4475 transitions. [2023-11-23 00:11:02,140 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4475 transitions. Word has length 77 [2023-11-23 00:11:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 3126 states and 4475 transitions. [2023-11-23 00:11:02,140 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-23 00:11:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4475 transitions. [2023-11-23 00:11:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 00:11:02,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:02,141 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-23 00:11:02,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 00:11:02,142 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-23 00:11:02,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash 514441370, now seen corresponding path program 1 times [2023-11-23 00:11:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:02,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617977540] [2023-11-23 00:11:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 00:11:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 00:11:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 00:11:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 00:11:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 00:11:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 00:11:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:02,529 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-23 00:11:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617977540] [2023-11-23 00:11:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617977540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:11:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 00:11:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646973755] [2023-11-23 00:11:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:02,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 00:11:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 00:11:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 00:11:02,531 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-23 00:11:04,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:11:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:11,753 INFO L93 Difference]: Finished difference Result 6472 states and 9338 transitions. [2023-11-23 00:11:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:11:11,756 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-23 00:11:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:11,769 INFO L225 Difference]: With dead ends: 6472 [2023-11-23 00:11:11,770 INFO L226 Difference]: Without dead ends: 3373 [2023-11-23 00:11:11,814 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-23 00:11:11,814 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 5434 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3801 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5532 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 7529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 3801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-23 00:11:11,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5532 Valid, 438 Invalid, 7529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 3801 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-11-23 00:11:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2023-11-23 00:11:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3126. [2023-11-23 00:11:11,970 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-23 00:11:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4481 transitions. [2023-11-23 00:11:11,980 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4481 transitions. Word has length 97 [2023-11-23 00:11:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:11,980 INFO L495 AbstractCegarLoop]: Abstraction has 3126 states and 4481 transitions. [2023-11-23 00:11:11,981 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-23 00:11:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4481 transitions. [2023-11-23 00:11:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 00:11:11,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:11,982 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-23 00:11:11,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 00:11:11,983 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-23 00:11:11,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -579786239, now seen corresponding path program 1 times [2023-11-23 00:11:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945107466] [2023-11-23 00:11:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:11:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:11:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:11:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:11:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:11:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:11:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:11:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:11:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:11:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:11:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:12,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-23 00:11:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945107466] [2023-11-23 00:11:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945107466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:11:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:11:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135131237] [2023-11-23 00:11:12,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:12,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:11:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:11:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:11:12,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-23 00:11:15,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:11:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:20,498 INFO L93 Difference]: Finished difference Result 3126 states and 4481 transitions. [2023-11-23 00:11:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:11:20,503 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-23 00:11:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:20,517 INFO L225 Difference]: With dead ends: 3126 [2023-11-23 00:11:20,517 INFO L226 Difference]: Without dead ends: 3123 [2023-11-23 00:11:20,517 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-23 00:11:20,518 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-23 00:11:20,518 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-23 00:11:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2023-11-23 00:11:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3123. [2023-11-23 00:11:20,670 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-23 00:11:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4478 transitions. [2023-11-23 00:11:20,678 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4478 transitions. Word has length 82 [2023-11-23 00:11:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:20,678 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4478 transitions. [2023-11-23 00:11:20,678 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-23 00:11:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4478 transitions. [2023-11-23 00:11:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 00:11:20,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:20,679 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-23 00:11:20,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 00:11:20,680 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-23 00:11:20,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1016504492, now seen corresponding path program 1 times [2023-11-23 00:11:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025934741] [2023-11-23 00:11:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 00:11:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 00:11:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 00:11:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 00:11:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 00:11:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 00:11:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 00:11:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,099 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-23 00:11:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025934741] [2023-11-23 00:11:21,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025934741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 00:11:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3997291] [2023-11-23 00:11:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:21,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:11:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:11:21,101 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-23 00:11:21,102 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-23 00:11:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:21,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 00:11:21,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:11:22,006 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-23 00:11:22,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 00:11:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3997291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 00:11:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-23 00:11:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732715313] [2023-11-23 00:11:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:11:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:11:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 00:11:22,008 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-23 00:11:24,030 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-23 00:11:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:24,489 INFO L93 Difference]: Finished difference Result 6213 states and 8908 transitions. [2023-11-23 00:11:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:11:24,490 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-23 00:11:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:24,499 INFO L225 Difference]: With dead ends: 6213 [2023-11-23 00:11:24,499 INFO L226 Difference]: Without dead ends: 3117 [2023-11-23 00:11:24,507 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-23 00:11:24,507 INFO L413 NwaCegarLoop]: 2089 mSDtfsCounter, 2281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:11:24,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 2089 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-11-23 00:11:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2023-11-23 00:11:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3117. [2023-11-23 00:11:24,697 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-23 00:11:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4469 transitions. [2023-11-23 00:11:24,707 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4469 transitions. Word has length 102 [2023-11-23 00:11:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:24,708 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4469 transitions. [2023-11-23 00:11:24,708 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-23 00:11:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4469 transitions. [2023-11-23 00:11:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 00:11:24,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:24,709 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-23 00:11:24,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 00:11:24,926 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-23 00:11:24,926 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-23 00:11:24,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 953590167, now seen corresponding path program 1 times [2023-11-23 00:11:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742815627] [2023-11-23 00:11:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:11:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:11:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:11:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:11:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:11:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:11:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:11:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:11:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:11:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:11:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:11:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:25,333 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-23 00:11:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742815627] [2023-11-23 00:11:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742815627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:25,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:11:25,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:11:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537971954] [2023-11-23 00:11:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:11:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:11:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:11:25,336 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-23 00:11:27,353 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-23 00:11:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:33,359 INFO L93 Difference]: Finished difference Result 3119 states and 4470 transitions. [2023-11-23 00:11:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:11:33,360 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-23 00:11:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:33,367 INFO L225 Difference]: With dead ends: 3119 [2023-11-23 00:11:33,367 INFO L226 Difference]: Without dead ends: 3116 [2023-11-23 00:11:33,367 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-23 00:11:33,368 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3986 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4397 mSolverCounterSat, 2349 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4069 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2349 IncrementalHoareTripleChecker+Valid, 4397 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:11:33,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4069 Valid, 624 Invalid, 6747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2349 Valid, 4397 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2023-11-23 00:11:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2023-11-23 00:11:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2023-11-23 00:11:33,529 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-23 00:11:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4467 transitions. [2023-11-23 00:11:33,536 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4467 transitions. Word has length 87 [2023-11-23 00:11:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:33,537 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4467 transitions. [2023-11-23 00:11:33,537 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-23 00:11:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4467 transitions. [2023-11-23 00:11:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 00:11:33,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:33,538 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-23 00:11:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 00:11:33,538 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-23 00:11:33,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1184229116, now seen corresponding path program 1 times [2023-11-23 00:11:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440139598] [2023-11-23 00:11:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 00:11:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 00:11:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 00:11:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 00:11:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 00:11:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 00:11:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:34,143 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-23 00:11:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440139598] [2023-11-23 00:11:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440139598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:11:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 00:11:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17961285] [2023-11-23 00:11:34,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:34,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 00:11:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 00:11:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 00:11:34,145 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-23 00:11:37,848 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-23 00:11:41,303 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-23 00:11:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:11:52,228 INFO L93 Difference]: Finished difference Result 7368 states and 10569 transitions. [2023-11-23 00:11:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 00:11:52,229 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-23 00:11:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:11:52,240 INFO L225 Difference]: With dead ends: 7368 [2023-11-23 00:11:52,240 INFO L226 Difference]: Without dead ends: 4279 [2023-11-23 00:11:52,249 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-23 00:11:52,249 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 5803 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 10700 mSolverCounterSat, 3659 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5894 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 14360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3659 IncrementalHoareTripleChecker+Valid, 10700 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-23 00:11:52,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5894 Valid, 967 Invalid, 14360 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3659 Valid, 10700 Invalid, 1 Unknown, 0 Unchecked, 17.5s Time] [2023-11-23 00:11:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2023-11-23 00:11:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4070. [2023-11-23 00:11:52,539 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-23 00:11:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5727 transitions. [2023-11-23 00:11:52,550 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5727 transitions. Word has length 107 [2023-11-23 00:11:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:11:52,550 INFO L495 AbstractCegarLoop]: Abstraction has 4070 states and 5727 transitions. [2023-11-23 00:11:52,551 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-23 00:11:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5727 transitions. [2023-11-23 00:11:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 00:11:52,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:11:52,552 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-23 00:11:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 00:11:52,552 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-23 00:11:52,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:11:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1182382074, now seen corresponding path program 1 times [2023-11-23 00:11:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:11:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527066721] [2023-11-23 00:11:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:11:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:11:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:11:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:11:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 00:11:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 00:11:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:11:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:11:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:11:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:11:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 00:11:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 00:11:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 00:11:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 00:11:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:11:53,011 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-23 00:11:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:11:53,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527066721] [2023-11-23 00:11:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527066721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:11:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:11:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 00:11:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692132770] [2023-11-23 00:11:53,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:11:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 00:11:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:11:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 00:11:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 00:11:53,015 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-23 00:11:54,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:11:55,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:11:57,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:11:58,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:00,890 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-23 00:12:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:08,013 INFO L93 Difference]: Finished difference Result 4271 states and 6049 transitions. [2023-11-23 00:12:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 00:12:08,014 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-23 00:12:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:08,024 INFO L225 Difference]: With dead ends: 4271 [2023-11-23 00:12:08,025 INFO L226 Difference]: Without dead ends: 4268 [2023-11-23 00:12:08,026 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-23 00:12:08,027 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 3157 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 7770 mSolverCounterSat, 2263 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3157 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 10034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2263 IncrementalHoareTripleChecker+Valid, 7770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:08,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3157 Valid, 885 Invalid, 10034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2263 Valid, 7770 Invalid, 1 Unknown, 0 Unchecked, 14.5s Time] [2023-11-23 00:12:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2023-11-23 00:12:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4074. [2023-11-23 00:12:08,320 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-23 00:12:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5729 transitions. [2023-11-23 00:12:08,330 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5729 transitions. Word has length 107 [2023-11-23 00:12:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:08,330 INFO L495 AbstractCegarLoop]: Abstraction has 4074 states and 5729 transitions. [2023-11-23 00:12:08,331 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-23 00:12:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5729 transitions. [2023-11-23 00:12:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-23 00:12:08,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:08,332 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-23 00:12:08,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 00:12:08,332 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-23 00:12:08,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1513018459, now seen corresponding path program 1 times [2023-11-23 00:12:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926277257] [2023-11-23 00:12:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:12:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:12:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:12:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:12:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:12:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:12:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:12:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:12:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:12:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:12:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:12:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:08,711 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-23 00:12:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926277257] [2023-11-23 00:12:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926277257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754740534] [2023-11-23 00:12:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:08,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:08,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:08,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:08,713 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-23 00:12:12,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:13,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:17,956 INFO L93 Difference]: Finished difference Result 4074 states and 5729 transitions. [2023-11-23 00:12:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:12:17,956 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-23 00:12:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:17,964 INFO L225 Difference]: With dead ends: 4074 [2023-11-23 00:12:17,964 INFO L226 Difference]: Without dead ends: 4071 [2023-11-23 00:12:17,965 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-23 00:12:17,965 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3978 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4391 mSolverCounterSat, 2346 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4061 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2346 IncrementalHoareTripleChecker+Valid, 4391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:17,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4061 Valid, 624 Invalid, 6738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2346 Valid, 4391 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2023-11-23 00:12:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2023-11-23 00:12:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2023-11-23 00:12:18,224 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-23 00:12:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 5726 transitions. [2023-11-23 00:12:18,233 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 5726 transitions. Word has length 89 [2023-11-23 00:12:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:18,233 INFO L495 AbstractCegarLoop]: Abstraction has 4071 states and 5726 transitions. [2023-11-23 00:12:18,233 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-23 00:12:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 5726 transitions. [2023-11-23 00:12:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 00:12:18,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:18,234 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-23 00:12:18,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 00:12:18,235 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-23 00:12:18,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -673888163, now seen corresponding path program 1 times [2023-11-23 00:12:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825800912] [2023-11-23 00:12:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 00:12:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:12:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:12:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 00:12:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:12:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:12:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 00:12:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 00:12:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 00:12:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 00:12:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 00:12:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 00:12:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:18,603 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-23 00:12:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825800912] [2023-11-23 00:12:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825800912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485656096] [2023-11-23 00:12:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:18,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:18,605 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-23 00:12:20,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:22,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:27,054 INFO L93 Difference]: Finished difference Result 8296 states and 11807 transitions. [2023-11-23 00:12:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:12:27,055 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-23 00:12:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:27,072 INFO L225 Difference]: With dead ends: 8296 [2023-11-23 00:12:27,072 INFO L226 Difference]: Without dead ends: 4252 [2023-11-23 00:12:27,079 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-23 00:12:27,080 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 4586 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 3504 mSolverCounterSat, 2978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 6482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2978 IncrementalHoareTripleChecker+Valid, 3504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:27,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4679 Valid, 521 Invalid, 6482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2978 Valid, 3504 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-23 00:12:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2023-11-23 00:12:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 4060. [2023-11-23 00:12:27,350 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-23 00:12:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5708 transitions. [2023-11-23 00:12:27,359 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5708 transitions. Word has length 110 [2023-11-23 00:12:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:27,359 INFO L495 AbstractCegarLoop]: Abstraction has 4060 states and 5708 transitions. [2023-11-23 00:12:27,359 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-23 00:12:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5708 transitions. [2023-11-23 00:12:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-23 00:12:27,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:27,360 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-23 00:12:27,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 00:12:27,362 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-23 00:12:27,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1329488945, now seen corresponding path program 1 times [2023-11-23 00:12:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051860619] [2023-11-23 00:12:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:12:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:12:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:12:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:12:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:12:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:12:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:12:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:12:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:12:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:12:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:12:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:12:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:27,727 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-23 00:12:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:27,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051860619] [2023-11-23 00:12:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051860619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:27,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734446702] [2023-11-23 00:12:27,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:27,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:27,729 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-23 00:12:29,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:35,798 INFO L93 Difference]: Finished difference Result 4060 states and 5708 transitions. [2023-11-23 00:12:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:12:35,798 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-23 00:12:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:35,813 INFO L225 Difference]: With dead ends: 4060 [2023-11-23 00:12:35,813 INFO L226 Difference]: Without dead ends: 4057 [2023-11-23 00:12:35,814 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-23 00:12:35,814 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3959 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 2340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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, 7.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:35,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4041 Valid, 624 Invalid, 6714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2340 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-23 00:12:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2023-11-23 00:12:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 4057. [2023-11-23 00:12:36,088 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-23 00:12:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 5705 transitions. [2023-11-23 00:12:36,101 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 5705 transitions. Word has length 94 [2023-11-23 00:12:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:36,101 INFO L495 AbstractCegarLoop]: Abstraction has 4057 states and 5705 transitions. [2023-11-23 00:12:36,102 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-23 00:12:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 5705 transitions. [2023-11-23 00:12:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-23 00:12:36,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:36,103 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-23 00:12:36,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 00:12:36,103 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-23 00:12:36,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2130622147, now seen corresponding path program 1 times [2023-11-23 00:12:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685633200] [2023-11-23 00:12:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:12:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:12:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:12:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:12:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:12:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:12:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:12:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:12:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:12:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:12:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:12:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:12:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 00:12:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:36,513 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-23 00:12:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685633200] [2023-11-23 00:12:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685633200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:36,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:36,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302434553] [2023-11-23 00:12:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:36,515 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-23 00:12:37,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:44,997 INFO L93 Difference]: Finished difference Result 4057 states and 5705 transitions. [2023-11-23 00:12:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:12:45,000 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-23 00:12:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:45,007 INFO L225 Difference]: With dead ends: 4057 [2023-11-23 00:12:45,007 INFO L226 Difference]: Without dead ends: 4054 [2023-11-23 00:12:45,007 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-23 00:12:45,008 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3953 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4368 mSolverCounterSat, 2337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s 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.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:45,008 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.1s Time] [2023-11-23 00:12:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2023-11-23 00:12:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4054. [2023-11-23 00:12:45,280 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-23 00:12:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5702 transitions. [2023-11-23 00:12:45,288 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5702 transitions. Word has length 99 [2023-11-23 00:12:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:45,288 INFO L495 AbstractCegarLoop]: Abstraction has 4054 states and 5702 transitions. [2023-11-23 00:12:45,288 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-23 00:12:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5702 transitions. [2023-11-23 00:12:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 00:12:45,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:45,290 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-23 00:12:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 00:12:45,290 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-23 00:12:45,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -990480109, now seen corresponding path program 1 times [2023-11-23 00:12:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147795831] [2023-11-23 00:12:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:12:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:12:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:12:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:12:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:12:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:12:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:12:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:12:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:12:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:12:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:12:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:12:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 00:12:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 00:12:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:45,639 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-23 00:12:45,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:45,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147795831] [2023-11-23 00:12:45,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147795831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:45,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:45,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427005340] [2023-11-23 00:12:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:45,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:45,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:45,641 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-23 00:12:47,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:49,066 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-23 00:12:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:12:54,318 INFO L93 Difference]: Finished difference Result 4054 states and 5702 transitions. [2023-11-23 00:12:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:12:54,319 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-23 00:12:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:12:54,325 INFO L225 Difference]: With dead ends: 4054 [2023-11-23 00:12:54,325 INFO L226 Difference]: Without dead ends: 4051 [2023-11-23 00:12:54,326 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-23 00:12:54,326 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3947 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4362 mSolverCounterSat, 2334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s 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, 8.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:12:54,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4027 Valid, 624 Invalid, 6696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2334 Valid, 4362 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-23 00:12:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2023-11-23 00:12:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4051. [2023-11-23 00:12:54,615 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-23 00:12:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5699 transitions. [2023-11-23 00:12:54,623 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5699 transitions. Word has length 104 [2023-11-23 00:12:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:12:54,623 INFO L495 AbstractCegarLoop]: Abstraction has 4051 states and 5699 transitions. [2023-11-23 00:12:54,623 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-23 00:12:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5699 transitions. [2023-11-23 00:12:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 00:12:54,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:12:54,631 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-23 00:12:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 00:12:54,632 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-23 00:12:54,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:12:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1267627268, now seen corresponding path program 1 times [2023-11-23 00:12:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:12:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254057201] [2023-11-23 00:12:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:12:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:12:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:12:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:12:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:12:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:12:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:12:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:12:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:12:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:12:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:12:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:12:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:12:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:12:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:12:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:12:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:12:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:12:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 00:12:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 00:12:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 00:12:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:12:54,964 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-23 00:12:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:12:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254057201] [2023-11-23 00:12:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254057201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:12:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:12:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:12:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945104875] [2023-11-23 00:12:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:12:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:12:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:12:54,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:12:54,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:12:54,966 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-23 00:12:56,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:12:58,582 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-23 00:13:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:13:03,110 INFO L93 Difference]: Finished difference Result 4051 states and 5699 transitions. [2023-11-23 00:13:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:13:03,111 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-23 00:13:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:13:03,117 INFO L225 Difference]: With dead ends: 4051 [2023-11-23 00:13:03,117 INFO L226 Difference]: Without dead ends: 4048 [2023-11-23 00:13:03,118 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-23 00:13:03,118 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3941 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 2331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s 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, 7.8s IncrementalHoareTripleChecker+Time [2023-11-23 00:13:03,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 624 Invalid, 6687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2331 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-23 00:13:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2023-11-23 00:13:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 4048. [2023-11-23 00:13:03,456 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-23 00:13:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5696 transitions. [2023-11-23 00:13:03,465 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5696 transitions. Word has length 109 [2023-11-23 00:13:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:13:03,466 INFO L495 AbstractCegarLoop]: Abstraction has 4048 states and 5696 transitions. [2023-11-23 00:13:03,466 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-23 00:13:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5696 transitions. [2023-11-23 00:13:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 00:13:03,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:13:03,467 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-23 00:13:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 00:13:03,467 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-23 00:13:03,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:13:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2168840, now seen corresponding path program 1 times [2023-11-23 00:13:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:13:03,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725696493] [2023-11-23 00:13:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:13:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:13:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:13:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:13:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:13:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:13:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:13:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:13:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:13:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:13:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:13:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:13:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:13:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:13:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:13:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:13:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:13:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:13:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 00:13:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 00:13:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 00:13:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 00:13:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:03,830 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-23 00:13:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:13:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725696493] [2023-11-23 00:13:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725696493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:13:03,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:13:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:13:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696873766] [2023-11-23 00:13:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:13:03,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:13:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:13:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:13:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:13:03,834 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) [2023-11-23 00:13:05,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:13:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:13:11,096 INFO L93 Difference]: Finished difference Result 4048 states and 5696 transitions. [2023-11-23 00:13:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 00:13:11,096 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 114 [2023-11-23 00:13:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:13:11,102 INFO L225 Difference]: With dead ends: 4048 [2023-11-23 00:13:11,102 INFO L226 Difference]: Without dead ends: 4045 [2023-11-23 00:13:11,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 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-23 00:13:11,103 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3935 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 2328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4013 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2328 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-23 00:13:11,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4013 Valid, 624 Invalid, 6678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2328 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-23 00:13:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2023-11-23 00:13:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 4045. [2023-11-23 00:13:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2622 states have (on average 1.3253241800152555) internal successors, (3475), 2710 states have internal predecessors, (3475), 1083 states have call successors, (1083), 330 states have call predecessors, (1083), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-23 00:13:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 5693 transitions. [2023-11-23 00:13:11,377 INFO L78 Accepts]: Start accepts. Automaton has 4045 states and 5693 transitions. Word has length 114 [2023-11-23 00:13:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:13:11,378 INFO L495 AbstractCegarLoop]: Abstraction has 4045 states and 5693 transitions. [2023-11-23 00:13:11,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-11-23 00:13:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4045 states and 5693 transitions. [2023-11-23 00:13:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 00:13:11,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:13:11,379 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, 1, 1, 1, 1, 1] [2023-11-23 00:13:11,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 00:13:11,380 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_linux_lib_idrErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-23 00:13:11,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:13:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1426296724, now seen corresponding path program 1 times [2023-11-23 00:13:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:13:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744326400] [2023-11-23 00:13:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:13:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:13:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:13:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 00:13:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 00:13:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 00:13:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 00:13:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 00:13:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 00:13:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 00:13:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 00:13:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 00:13:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 00:13:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 00:13:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 00:13:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 00:13:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 00:13:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 00:13:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 00:13:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 00:13:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 00:13:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 00:13:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 00:13:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 00:13:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:13:11,787 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-23 00:13:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:13:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744326400] [2023-11-23 00:13:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744326400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:13:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:13:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 00:13:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213790738] [2023-11-23 00:13:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:13:11,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 00:13:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:13:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 00:13:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 00:13:11,789 INFO L87 Difference]: Start difference. First operand 4045 states and 5693 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-23 00:13:13,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 00:13:15,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15