./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i --full-output --preprocessor.use.memory.slicer true --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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:31:28,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:31:28,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 21:31:28,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:31:28,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:31:28,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:31:28,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:31:28,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:31:28,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:31:28,801 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:31:28,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:31:28,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:31:28,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:31:28,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:31:28,804 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:31:28,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:31:28,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:31:28,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:31:28,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:31:28,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:31:28,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:31:28,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:31:28,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:31:28,806 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:31:28,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:31:28,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:31:28,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:31:28,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:31:28,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:31:28,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:31:28,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:31:28,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:31:28,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:31:28,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:31:28,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:31:28,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:31:28,809 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:31:28,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:31:28,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:31:28,809 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 -> 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:31:29,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:31:29,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:31:29,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:31:29,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:31:29,027 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:31:29,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2023-11-22 21:31:29,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:31:30,442 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:31:30,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2023-11-22 21:31:30,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68f60bc4/acacbf5fb5624e718147ff353fdb6cc0/FLAG80685d97c [2023-11-22 21:31:30,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68f60bc4/acacbf5fb5624e718147ff353fdb6cc0 [2023-11-22 21:31:30,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:31:30,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:31:30,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:31:30,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:31:30,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:31:30,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:30" (1/1) ... [2023-11-22 21:31:30,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6509c01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:30, skipping insertion in model container [2023-11-22 21:31:30,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:30" (1/1) ... [2023-11-22 21:31:30,621 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:31:32,557 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2023-11-22 21:31:32,561 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2023-11-22 21:31:32,561 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2023-11-22 21:31:32,562 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2023-11-22 21:31:32,562 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2023-11-22 21:31:32,562 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2023-11-22 21:31:32,563 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2023-11-22 21:31:32,563 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2023-11-22 21:31:32,563 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2023-11-22 21:31:32,563 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2023-11-22 21:31:32,564 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2023-11-22 21:31:32,564 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2023-11-22 21:31:32,564 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2023-11-22 21:31:32,565 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2023-11-22 21:31:32,565 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2023-11-22 21:31:32,565 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2023-11-22 21:31:32,566 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2023-11-22 21:31:32,566 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2023-11-22 21:31:32,566 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2023-11-22 21:31:32,566 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2023-11-22 21:31:32,567 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2023-11-22 21:31:32,567 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2023-11-22 21:31:32,567 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2023-11-22 21:31:32,568 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2023-11-22 21:31:32,568 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2023-11-22 21:31:32,568 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2023-11-22 21:31:32,569 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2023-11-22 21:31:32,569 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2023-11-22 21:31:32,569 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2023-11-22 21:31:32,569 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2023-11-22 21:31:32,570 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2023-11-22 21:31:32,570 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2023-11-22 21:31:32,570 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2023-11-22 21:31:32,571 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2023-11-22 21:31:32,571 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2023-11-22 21:31:32,571 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2023-11-22 21:31:32,571 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2023-11-22 21:31:32,572 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2023-11-22 21:31:32,572 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2023-11-22 21:31:32,572 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2023-11-22 21:31:32,573 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2023-11-22 21:31:32,573 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2023-11-22 21:31:32,573 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2023-11-22 21:31:32,574 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2023-11-22 21:31:32,574 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2023-11-22 21:31:32,574 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2023-11-22 21:31:32,574 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2023-11-22 21:31:32,575 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2023-11-22 21:31:32,575 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2023-11-22 21:31:32,575 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2023-11-22 21:31:32,576 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2023-11-22 21:31:32,576 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2023-11-22 21:31:32,576 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2023-11-22 21:31:32,576 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2023-11-22 21:31:32,577 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2023-11-22 21:31:32,577 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2023-11-22 21:31:32,577 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2023-11-22 21:31:32,578 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2023-11-22 21:31:32,578 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2023-11-22 21:31:32,578 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2023-11-22 21:31:32,578 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2023-11-22 21:31:32,579 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2023-11-22 21:31:32,579 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2023-11-22 21:31:32,579 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2023-11-22 21:31:32,580 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2023-11-22 21:31:32,580 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2023-11-22 21:31:32,580 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2023-11-22 21:31:32,580 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2023-11-22 21:31:32,581 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2023-11-22 21:31:32,581 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2023-11-22 21:31:32,581 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2023-11-22 21:31:32,582 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2023-11-22 21:31:32,582 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2023-11-22 21:31:32,582 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2023-11-22 21:31:32,582 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2023-11-22 21:31:32,583 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2023-11-22 21:31:32,583 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2023-11-22 21:31:32,583 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2023-11-22 21:31:32,584 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2023-11-22 21:31:32,584 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2023-11-22 21:31:32,584 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2023-11-22 21:31:32,584 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2023-11-22 21:31:32,585 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2023-11-22 21:31:32,585 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2023-11-22 21:31:32,585 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2023-11-22 21:31:32,586 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2023-11-22 21:31:32,586 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2023-11-22 21:31:32,586 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2023-11-22 21:31:32,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:31:32,643 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:31:32,749 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; cmpxchgb %2,%1": "=a" (__ret), "+m" (*__ptr): "q" (__new), "0" (__old): "memory"); [4593-4594] [2023-11-22 21:31:32,751 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; cmpxchgw %2,%1": "=a" (__ret), "+m" (*__ptr___0): "r" (__new), "0" (__old): "memory"); [4598-4599] [2023-11-22 21:31:32,751 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; cmpxchgl %2,%1": "=a" (__ret), "+m" (*__ptr___1): "r" (__new), "0" (__old): "memory"); [4603-4604] [2023-11-22 21:31:32,751 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; cmpxchgq %2,%1": "=a" (__ret), "+m" (*__ptr___2): "r" (__new), "0" (__old): "memory"); [4608-4609] [2023-11-22 21:31:32,875 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2023-11-22 21:31:32,876 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2023-11-22 21:31:32,876 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2023-11-22 21:31:32,877 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2023-11-22 21:31:32,881 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2023-11-22 21:31:32,881 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2023-11-22 21:31:32,881 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2023-11-22 21:31:32,882 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2023-11-22 21:31:32,882 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2023-11-22 21:31:32,882 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2023-11-22 21:31:32,883 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2023-11-22 21:31:32,883 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2023-11-22 21:31:32,884 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2023-11-22 21:31:32,885 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2023-11-22 21:31:32,885 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2023-11-22 21:31:32,886 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2023-11-22 21:31:32,886 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2023-11-22 21:31:32,886 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2023-11-22 21:31:32,887 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2023-11-22 21:31:32,887 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2023-11-22 21:31:32,888 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2023-11-22 21:31:32,888 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2023-11-22 21:31:32,888 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2023-11-22 21:31:32,889 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2023-11-22 21:31:32,889 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2023-11-22 21:31:32,889 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2023-11-22 21:31:32,889 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2023-11-22 21:31:32,890 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2023-11-22 21:31:32,890 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2023-11-22 21:31:32,891 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2023-11-22 21:31:32,891 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2023-11-22 21:31:32,891 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2023-11-22 21:31:32,892 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2023-11-22 21:31:32,893 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2023-11-22 21:31:32,894 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2023-11-22 21:31:32,894 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2023-11-22 21:31:32,894 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2023-11-22 21:31:32,895 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2023-11-22 21:31:32,895 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2023-11-22 21:31:32,895 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2023-11-22 21:31:32,896 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2023-11-22 21:31:32,897 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2023-11-22 21:31:32,897 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2023-11-22 21:31:32,897 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2023-11-22 21:31:32,898 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2023-11-22 21:31:32,898 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2023-11-22 21:31:32,898 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2023-11-22 21:31:32,899 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2023-11-22 21:31:32,899 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2023-11-22 21:31:32,899 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2023-11-22 21:31:32,899 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2023-11-22 21:31:32,900 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2023-11-22 21:31:32,900 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2023-11-22 21:31:32,900 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2023-11-22 21:31:32,901 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2023-11-22 21:31:32,901 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2023-11-22 21:31:32,901 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2023-11-22 21:31:32,902 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2023-11-22 21:31:32,902 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2023-11-22 21:31:32,902 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2023-11-22 21:31:32,903 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2023-11-22 21:31:32,903 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2023-11-22 21:31:32,903 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2023-11-22 21:31:32,904 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2023-11-22 21:31:32,904 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2023-11-22 21:31:32,905 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2023-11-22 21:31:32,905 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2023-11-22 21:31:32,905 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2023-11-22 21:31:32,911 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2023-11-22 21:31:32,912 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2023-11-22 21:31:32,912 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2023-11-22 21:31:32,913 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2023-11-22 21:31:32,913 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2023-11-22 21:31:32,913 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2023-11-22 21:31:32,914 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2023-11-22 21:31:32,914 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2023-11-22 21:31:32,914 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2023-11-22 21:31:32,914 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2023-11-22 21:31:32,915 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2023-11-22 21:31:32,916 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2023-11-22 21:31:32,916 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2023-11-22 21:31:32,916 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2023-11-22 21:31:32,917 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2023-11-22 21:31:32,917 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2023-11-22 21:31:32,917 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2023-11-22 21:31:32,917 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2023-11-22 21:31:32,918 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2023-11-22 21:31:32,918 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-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2023-11-22 21:31:32,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:31:33,080 WARN L675 CHandler]: The function __cmpxchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:31:33,086 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:31:33,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33 WrapperNode [2023-11-22 21:31:33,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:31:33,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:31:33,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:31:33,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:31:33,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,271 INFO L138 Inliner]: procedures = 591, calls = 1851, calls flagged for inlining = 314, calls inlined = 232, statements flattened = 4669 [2023-11-22 21:31:33,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:31:33,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:31:33,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:31:33,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:31:33,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,303 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,939 INFO L189 HeapSplitter]: Split 763 memory accesses to 16 slices as follows [2, 14, 8, 6, 38, 516, 1, 1, 2, 42, 2, 74, 13, 1, 39, 4] [2023-11-22 21:31:33,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:33,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:31:34,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:31:34,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:31:34,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:31:34,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (1/1) ... [2023-11-22 21:31:34,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:31:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:31:34,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:31:34,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:31:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 21:31:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 21:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-22 21:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-22 21:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 21:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 21:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-22 21:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-22 21:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 21:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 21:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_unregister [2023-11-22 21:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_unregister [2023-11-22 21:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-22 21:31:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-22 21:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-22 21:31:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-22 21:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_get_drvdata [2023-11-22 21:31:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_get_drvdata [2023-11-22 21:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-22 21:31:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-22 21:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_poll [2023-11-22 21:31:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_poll [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_put_noidle [2023-11-22 21:31:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_put_noidle [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-22 21:31:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2023-11-22 21:31:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-22 21:31:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-22 21:31:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-22 21:31:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2023-11-22 21:31:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2023-11-22 21:31:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2023-11-22 21:31:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2023-11-22 21:31:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-22 21:31:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-22 21:31:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 21:31:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 21:31:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 21:31:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 21:31:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-22 21:31:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 21:31:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2023-11-22 21:31:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 21:31:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 21:31:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2023-11-22 21:31:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2023-11-22 21:31:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_resume [2023-11-22 21:31:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_resume [2023-11-22 21:31:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure iio_priv [2023-11-22 21:31:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_priv [2023-11-22 21:31:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 21:31:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 21:31:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2023-11-22 21:31:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2023-11-22 21:31:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 21:31:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_acc_reg [2023-11-22 21:31:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_acc_reg [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_mode [2023-11-22 21:31:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_mode [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-22 21:31:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-22 21:31:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 21:31:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 21:31:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 21:31:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-22 21:31:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-22 21:31:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-22 21:31:34,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-22 21:31:34,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-22 21:31:34,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-22 21:31:34,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-22 21:31:34,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-22 21:31:34,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-22 21:31:34,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-22 21:31:34,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-22 21:31:34,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-22 21:31:34,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-11-22 21:31:34,166 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:31:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:31:34,168 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-22 21:31:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-22 21:31:34,168 INFO L130 BoogieDeclarations]: Found specification of procedure iio_push_event [2023-11-22 21:31:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_push_event [2023-11-22 21:31:34,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 21:31:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 21:31:34,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2023-11-22 21:31:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2023-11-22 21:31:34,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2023-11-22 21:31:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2023-11-22 21:31:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:31:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:31:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2023-11-22 21:31:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_trig_try_reen [2023-11-22 21:31:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_trig_try_reen [2023-11-22 21:31:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-22 21:31:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-22 21:31:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_remove [2023-11-22 21:31:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_remove [2023-11-22 21:31:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2023-11-22 21:31:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2023-11-22 21:31:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_range [2023-11-22 21:31:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_range [2023-11-22 21:31:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-22 21:31:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-22 21:31:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 21:31:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 21:31:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:31:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_register [2023-11-22 21:31:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_register [2023-11-22 21:31:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 21:31:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 21:31:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2023-11-22 21:31:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2023-11-22 21:31:34,171 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_read_byte_data [2023-11-22 21:31:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_read_byte_data [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-22 21:31:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure iio_triggered_buffer_cleanup [2023-11-22 21:31:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_triggered_buffer_cleanup [2023-11-22 21:31:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_suspend [2023-11-22 21:31:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_suspend [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-22 21:31:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-22 21:31:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-22 21:31:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-22 21:31:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 21:31:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 21:31:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_power_state [2023-11-22 21:31:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_power_state [2023-11-22 21:31:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-22 21:31:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-22 21:31:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_set_drvdata [2023-11-22 21:31:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_set_drvdata [2023-11-22 21:31:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_register [2023-11-22 21:31:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_register [2023-11-22 21:31:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 21:31:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure __pm_runtime_set_status [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __pm_runtime_set_status [2023-11-22 21:31:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 21:31:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 21:31:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_unregister [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_unregister [2023-11-22 21:31:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 21:31:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure iio_device_unregister [2023-11-22 21:31:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_device_unregister [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 21:31:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_setup_any_motion_interrupt [2023-11-22 21:31:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_setup_any_motion_interrupt [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_triggered_buffer_cleanup [2023-11-22 21:31:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_triggered_buffer_cleanup [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 21:31:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-22 21:31:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 21:31:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure devm_iio_trigger_alloc [2023-11-22 21:31:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_iio_trigger_alloc [2023-11-22 21:31:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-22 21:31:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-22 21:31:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 21:31:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 21:31:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_mode [2023-11-22 21:31:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_mode [2023-11-22 21:31:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_resume [2023-11-22 21:31:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_resume [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-22 21:31:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 21:31:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_suspend [2023-11-22 21:31:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_suspend [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-22 21:31:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-22 21:31:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-22 21:31:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_write_byte_data [2023-11-22 21:31:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_write_byte_data [2023-11-22 21:31:34,786 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:31:34,788 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:31:34,871 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-22 21:31:38,680 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:31:38,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:31:38,868 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:31:38,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:38 BoogieIcfgContainer [2023-11-22 21:31:38,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:31:38,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:31:38,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:31:38,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:31:38,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:31:30" (1/3) ... [2023-11-22 21:31:38,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfe2ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:38, skipping insertion in model container [2023-11-22 21:31:38,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:33" (2/3) ... [2023-11-22 21:31:38,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfe2ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:38, skipping insertion in model container [2023-11-22 21:31:38,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:38" (3/3) ... [2023-11-22 21:31:38,875 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2023-11-22 21:31:38,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:31:38,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-22 21:31:38,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:31:38,939 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;@12f013c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:31:38,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-22 21:31:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 1314 states, 836 states have (on average 1.3911483253588517) internal successors, (1163), 884 states have internal predecessors, (1163), 378 states have call successors, (378), 74 states have call predecessors, (378), 73 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2023-11-22 21:31:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 21:31:38,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:31:38,953 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:31:38,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:31:38,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:31:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1081779175, now seen corresponding path program 1 times [2023-11-22 21:31:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:31:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286035242] [2023-11-22 21:31:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:31:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:31:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:31:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:31:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:31:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:31:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:31:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:31:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:31:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:31:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:31:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:31:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:31:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286035242] [2023-11-22 21:31:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286035242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:31:40,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:31:40,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:31:40,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057454132] [2023-11-22 21:31:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:31:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:31:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:31:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:31:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:31:40,326 INFO L87 Difference]: Start difference. First operand has 1314 states, 836 states have (on average 1.3911483253588517) internal successors, (1163), 884 states have internal predecessors, (1163), 378 states have call successors, (378), 74 states have call predecessors, (378), 73 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-22 21:31:42,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:31:44,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:31:46,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:31:48,442 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-22 21:31:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:31:52,697 INFO L93 Difference]: Finished difference Result 2603 states and 3922 transitions. [2023-11-22 21:31:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:31:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 47 [2023-11-22 21:31:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:31:52,717 INFO L225 Difference]: With dead ends: 2603 [2023-11-22 21:31:52,717 INFO L226 Difference]: Without dead ends: 1297 [2023-11-22 21:31:52,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:31:52,732 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 2667 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 1399 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 4344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1399 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:31:52,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 2123 Invalid, 4344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1399 Valid, 2941 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2023-11-22 21:31:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2023-11-22 21:31:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2023-11-22 21:31:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 828 states have (on average 1.3417874396135265) internal successors, (1111), 870 states have internal predecessors, (1111), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:31:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1853 transitions. [2023-11-22 21:31:52,854 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1853 transitions. Word has length 47 [2023-11-22 21:31:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:31:52,855 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1853 transitions. [2023-11-22 21:31:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-22 21:31:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1853 transitions. [2023-11-22 21:31:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 21:31:52,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:31:52,857 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:31:52,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:31:52,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:31:52,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:31:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1838169113, now seen corresponding path program 1 times [2023-11-22 21:31:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:31:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909879209] [2023-11-22 21:31:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:31:52,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:31:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:31:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:31:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:31:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:31:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:31:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:31:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:31:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:31:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:31:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:31:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:31:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:31:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:31:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909879209] [2023-11-22 21:31:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909879209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:31:53,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:31:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:31:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123984112] [2023-11-22 21:31:53,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:31:53,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:31:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:31:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:31:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:31:53,649 INFO L87 Difference]: Start difference. First operand 1297 states and 1853 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 21:31:55,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:31:57,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:31:59,728 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-22 21:32:01,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:32:05,392 INFO L93 Difference]: Finished difference Result 1297 states and 1853 transitions. [2023-11-22 21:32:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:32:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 52 [2023-11-22 21:32:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:32:05,399 INFO L225 Difference]: With dead ends: 1297 [2023-11-22 21:32:05,399 INFO L226 Difference]: Without dead ends: 1295 [2023-11-22 21:32:05,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:32:05,400 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2633 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:32:05,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 2091 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2917 Invalid, 4 Unknown, 0 Unchecked, 11.5s Time] [2023-11-22 21:32:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-11-22 21:32:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2023-11-22 21:32:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 827 states have (on average 1.3409915356711004) internal successors, (1109), 868 states have internal predecessors, (1109), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:32:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1851 transitions. [2023-11-22 21:32:05,443 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1851 transitions. Word has length 52 [2023-11-22 21:32:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:32:05,444 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1851 transitions. [2023-11-22 21:32:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 21:32:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1851 transitions. [2023-11-22 21:32:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 21:32:05,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:32:05,445 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:32:05,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:32:05,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:32:05,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:32:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1686281119, now seen corresponding path program 1 times [2023-11-22 21:32:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:32:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400508749] [2023-11-22 21:32:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:32:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:32:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:32:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:32:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:32:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:32:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:32:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:32:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:32:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:32:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:32:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:32:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:32:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400508749] [2023-11-22 21:32:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400508749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:32:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:32:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:32:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820532562] [2023-11-22 21:32:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:32:06,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:32:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:32:06,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:32:06,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:32:06,262 INFO L87 Difference]: Start difference. First operand 1295 states and 1851 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 21:32:08,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:10,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:12,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:14,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:32:18,094 INFO L93 Difference]: Finished difference Result 1295 states and 1851 transitions. [2023-11-22 21:32:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:32:18,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 57 [2023-11-22 21:32:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:32:18,100 INFO L225 Difference]: With dead ends: 1295 [2023-11-22 21:32:18,100 INFO L226 Difference]: Without dead ends: 1293 [2023-11-22 21:32:18,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:32:18,101 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2627 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2826 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-11-22 21:32:18,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2826 Valid, 2091 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2913 Invalid, 4 Unknown, 0 Unchecked, 11.6s Time] [2023-11-22 21:32:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2023-11-22 21:32:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2023-11-22 21:32:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 826 states have (on average 1.3401937046004844) internal successors, (1107), 866 states have internal predecessors, (1107), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:32:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1849 transitions. [2023-11-22 21:32:18,143 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1849 transitions. Word has length 57 [2023-11-22 21:32:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:32:18,144 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1849 transitions. [2023-11-22 21:32:18,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 21:32:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1849 transitions. [2023-11-22 21:32:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 21:32:18,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:32:18,146 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:32:18,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:32:18,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:32:18,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:32:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -235426452, now seen corresponding path program 1 times [2023-11-22 21:32:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:32:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511477449] [2023-11-22 21:32:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:32:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:32:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:32:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:32:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:32:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:32:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:32:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:32:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:32:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:32:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:32:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:32:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:32:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:32:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511477449] [2023-11-22 21:32:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511477449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:32:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:32:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:32:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272774749] [2023-11-22 21:32:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:32:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:32:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:32:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:32:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:32:18,929 INFO L87 Difference]: Start difference. First operand 1293 states and 1849 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-22 21:32:20,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:22,966 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-22 21:32:24,974 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-22 21:32:26,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:32:30,451 INFO L93 Difference]: Finished difference Result 1293 states and 1849 transitions. [2023-11-22 21:32:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:32:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 62 [2023-11-22 21:32:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:32:30,457 INFO L225 Difference]: With dead ends: 1293 [2023-11-22 21:32:30,457 INFO L226 Difference]: Without dead ends: 1291 [2023-11-22 21:32:30,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:32:30,458 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2621 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:32:30,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 2091 Invalid, 4299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2909 Invalid, 4 Unknown, 0 Unchecked, 11.4s Time] [2023-11-22 21:32:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2023-11-22 21:32:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2023-11-22 21:32:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 825 states have (on average 1.3393939393939394) internal successors, (1105), 864 states have internal predecessors, (1105), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:32:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1847 transitions. [2023-11-22 21:32:30,502 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1847 transitions. Word has length 62 [2023-11-22 21:32:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:32:30,502 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1847 transitions. [2023-11-22 21:32:30,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-22 21:32:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1847 transitions. [2023-11-22 21:32:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:32:30,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:32:30,504 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:32:30,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:32:30,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:32:30,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:32:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1156634606, now seen corresponding path program 1 times [2023-11-22 21:32:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:32:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011123094] [2023-11-22 21:32:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:32:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:32:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:32:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:32:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:32:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:32:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:32:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:32:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:32:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:32:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:32:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:32:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:32:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:32:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:32:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011123094] [2023-11-22 21:32:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011123094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:32:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:32:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:32:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644787157] [2023-11-22 21:32:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:32:31,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:32:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:32:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:32:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:32:31,299 INFO L87 Difference]: Start difference. First operand 1291 states and 1847 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:32:33,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:35,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:37,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:39,363 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-22 21:32:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:32:42,595 INFO L93 Difference]: Finished difference Result 1291 states and 1847 transitions. [2023-11-22 21:32:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:32:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 67 [2023-11-22 21:32:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:32:42,600 INFO L225 Difference]: With dead ends: 1291 [2023-11-22 21:32:42,601 INFO L226 Difference]: Without dead ends: 1289 [2023-11-22 21:32:42,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:32:42,601 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2615 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:32:42,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 2091 Invalid, 4295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2905 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2023-11-22 21:32:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2023-11-22 21:32:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2023-11-22 21:32:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 824 states have (on average 1.3385922330097086) internal successors, (1103), 862 states have internal predecessors, (1103), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:32:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1845 transitions. [2023-11-22 21:32:42,644 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1845 transitions. Word has length 67 [2023-11-22 21:32:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:32:42,644 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1845 transitions. [2023-11-22 21:32:42,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:32:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1845 transitions. [2023-11-22 21:32:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:32:42,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:32:42,645 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:32:42,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:32:42,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:32:42,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:32:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1115620388, now seen corresponding path program 1 times [2023-11-22 21:32:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:32:42,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628820275] [2023-11-22 21:32:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:32:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:32:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:32:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:32:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:32:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:32:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:32:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:32:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:32:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:32:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:32:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:32:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:32:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:32:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:32:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:32:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628820275] [2023-11-22 21:32:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628820275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:32:43,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:32:43,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:32:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622022366] [2023-11-22 21:32:43,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:32:43,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:32:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:32:43,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:32:43,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:32:43,376 INFO L87 Difference]: Start difference. First operand 1289 states and 1845 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 21:32:45,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:47,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:49,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:51,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:32:54,745 INFO L93 Difference]: Finished difference Result 1289 states and 1845 transitions. [2023-11-22 21:32:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:32:54,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 72 [2023-11-22 21:32:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:32:54,750 INFO L225 Difference]: With dead ends: 1289 [2023-11-22 21:32:54,750 INFO L226 Difference]: Without dead ends: 1287 [2023-11-22 21:32:54,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:32:54,753 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2609 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2805 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:32:54,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2805 Valid, 2091 Invalid, 4291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2901 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2023-11-22 21:32:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2023-11-22 21:32:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2023-11-22 21:32:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 823 states have (on average 1.3377885783718104) internal successors, (1101), 860 states have internal predecessors, (1101), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:32:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1843 transitions. [2023-11-22 21:32:54,853 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1843 transitions. Word has length 72 [2023-11-22 21:32:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:32:54,854 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1843 transitions. [2023-11-22 21:32:54,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 21:32:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1843 transitions. [2023-11-22 21:32:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-22 21:32:54,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:32:54,857 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:32:54,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 21:32:54,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:32:54,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:32:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1061644267, now seen corresponding path program 1 times [2023-11-22 21:32:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:32:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387372021] [2023-11-22 21:32:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:32:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:32:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:32:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:32:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:32:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:32:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:32:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:32:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:32:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:32:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:32:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:32:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:32:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:32:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:32:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:32:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:32:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:32:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:32:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387372021] [2023-11-22 21:32:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387372021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:32:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:32:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:32:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554371783] [2023-11-22 21:32:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:32:55,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:32:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:32:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:32:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:32:55,613 INFO L87 Difference]: Start difference. First operand 1287 states and 1843 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-22 21:32:57,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:32:59,650 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-22 21:33:01,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:03,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:33:06,776 INFO L93 Difference]: Finished difference Result 1287 states and 1843 transitions. [2023-11-22 21:33:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:33:06,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 77 [2023-11-22 21:33:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:33:06,781 INFO L225 Difference]: With dead ends: 1287 [2023-11-22 21:33:06,781 INFO L226 Difference]: Without dead ends: 1285 [2023-11-22 21:33:06,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:33:06,782 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2603 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:33:06,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 2091 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2897 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2023-11-22 21:33:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2023-11-22 21:33:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2023-11-22 21:33:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 822 states have (on average 1.3369829683698298) internal successors, (1099), 858 states have internal predecessors, (1099), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:33:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1841 transitions. [2023-11-22 21:33:06,830 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1841 transitions. Word has length 77 [2023-11-22 21:33:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:33:06,830 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1841 transitions. [2023-11-22 21:33:06,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-22 21:33:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1841 transitions. [2023-11-22 21:33:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-22 21:33:06,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:33:06,831 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:33:06,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 21:33:06,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:33:06,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:33:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1692062746, now seen corresponding path program 1 times [2023-11-22 21:33:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:33:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856032947] [2023-11-22 21:33:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:33:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:33:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:33:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:33:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:33:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:33:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:33:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:33:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:33:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:33:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:33:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:33:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:33:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:33:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:33:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:33:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:33:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856032947] [2023-11-22 21:33:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856032947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:33:07,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:33:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:33:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48422405] [2023-11-22 21:33:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:33:07,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:33:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:33:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:33:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:33:07,582 INFO L87 Difference]: Start difference. First operand 1285 states and 1841 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-22 21:33:09,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:11,622 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-22 21:33:13,629 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-22 21:33:15,644 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-22 21:33:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:33:18,689 INFO L93 Difference]: Finished difference Result 1285 states and 1841 transitions. [2023-11-22 21:33:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:33:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 82 [2023-11-22 21:33:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:33:18,693 INFO L225 Difference]: With dead ends: 1285 [2023-11-22 21:33:18,693 INFO L226 Difference]: Without dead ends: 1283 [2023-11-22 21:33:18,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:33:18,694 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2597 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:33:18,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 2091 Invalid, 4283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2893 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2023-11-22 21:33:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-22 21:33:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2023-11-22 21:33:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 821 states have (on average 1.3361753958587088) internal successors, (1097), 856 states have internal predecessors, (1097), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:33:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1839 transitions. [2023-11-22 21:33:18,743 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1839 transitions. Word has length 82 [2023-11-22 21:33:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:33:18,743 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1839 transitions. [2023-11-22 21:33:18,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-22 21:33:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1839 transitions. [2023-11-22 21:33:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-22 21:33:18,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:33:18,744 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:33:18,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:33:18,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:33:18,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:33:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1720438313, now seen corresponding path program 1 times [2023-11-22 21:33:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:33:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387689175] [2023-11-22 21:33:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:33:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:33:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:33:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:33:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:33:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:33:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:33:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:33:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:33:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:33:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:33:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:33:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:33:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:33:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:33:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:33:19,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:33:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387689175] [2023-11-22 21:33:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387689175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:33:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:33:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:33:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846880729] [2023-11-22 21:33:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:33:19,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:33:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:33:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:33:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:33:19,449 INFO L87 Difference]: Start difference. First operand 1283 states and 1839 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-22 21:33:21,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:23,497 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-22 21:33:25,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:27,522 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-22 21:33:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:33:30,741 INFO L93 Difference]: Finished difference Result 1283 states and 1839 transitions. [2023-11-22 21:33:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:33:30,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 84 [2023-11-22 21:33:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:33:30,747 INFO L225 Difference]: With dead ends: 1283 [2023-11-22 21:33:30,747 INFO L226 Difference]: Without dead ends: 1281 [2023-11-22 21:33:30,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:33:30,750 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2589 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2783 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 4279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:33:30,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2783 Valid, 2091 Invalid, 4279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2889 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2023-11-22 21:33:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2023-11-22 21:33:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1281. [2023-11-22 21:33:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 820 states have (on average 1.3353658536585367) internal successors, (1095), 854 states have internal predecessors, (1095), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:33:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1837 transitions. [2023-11-22 21:33:30,835 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1837 transitions. Word has length 84 [2023-11-22 21:33:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:33:30,836 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1837 transitions. [2023-11-22 21:33:30,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-22 21:33:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1837 transitions. [2023-11-22 21:33:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-22 21:33:30,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:33:30,841 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:33:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 21:33:30,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:33:30,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:33:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -264794645, now seen corresponding path program 1 times [2023-11-22 21:33:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:33:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337478018] [2023-11-22 21:33:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:33:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:33:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:33:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:33:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:33:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:33:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:33:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:33:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:33:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:33:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:33:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:33:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:33:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:33:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:33:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:33:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 21:33:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:33:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-22 21:33:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:33:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337478018] [2023-11-22 21:33:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337478018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:33:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:33:31,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:33:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426373307] [2023-11-22 21:33:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:33:31,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:33:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:33:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:33:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:33:31,606 INFO L87 Difference]: Start difference. First operand 1281 states and 1837 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 21:33:33,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:35,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:37,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:39,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:33:43,153 INFO L93 Difference]: Finished difference Result 1787 states and 2473 transitions. [2023-11-22 21:33:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:33:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 98 [2023-11-22 21:33:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:33:43,158 INFO L225 Difference]: With dead ends: 1787 [2023-11-22 21:33:43,158 INFO L226 Difference]: Without dead ends: 1283 [2023-11-22 21:33:43,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:33:43,160 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 2910 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 1828 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3123 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 4422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1828 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:33:43,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3123 Valid, 1627 Invalid, 4422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1828 Valid, 2590 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2023-11-22 21:33:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-22 21:33:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1277. [2023-11-22 21:33:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 817 states have (on average 1.3341493268053854) internal successors, (1090), 850 states have internal predecessors, (1090), 372 states have call successors, (372), 73 states have call predecessors, (372), 72 states have return successors, (370), 367 states have call predecessors, (370), 370 states have call successors, (370) [2023-11-22 21:33:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1832 transitions. [2023-11-22 21:33:43,222 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1832 transitions. Word has length 98 [2023-11-22 21:33:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:33:43,223 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 1832 transitions. [2023-11-22 21:33:43,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 21:33:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1832 transitions. [2023-11-22 21:33:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-22 21:33:43,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:33:43,224 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:33:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:33:43,224 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:33:43,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:33:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1329906716, now seen corresponding path program 1 times [2023-11-22 21:33:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:33:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116179993] [2023-11-22 21:33:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:33:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:33:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:33:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:33:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:33:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:33:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:33:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:33:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:33:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:33:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:33:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:33:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:33:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:33:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:33:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:33:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:33:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:33:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116179993] [2023-11-22 21:33:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116179993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:33:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:33:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:33:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106321160] [2023-11-22 21:33:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:33:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:33:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:33:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:33:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:33:43,994 INFO L87 Difference]: Start difference. First operand 1277 states and 1832 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 21:33:46,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:48,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:50,069 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-22 21:33:52,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:33:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:33:58,027 INFO L93 Difference]: Finished difference Result 2536 states and 3636 transitions. [2023-11-22 21:33:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 21:33:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 89 [2023-11-22 21:33:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:33:58,036 INFO L225 Difference]: With dead ends: 2536 [2023-11-22 21:33:58,036 INFO L226 Difference]: Without dead ends: 2534 [2023-11-22 21:33:58,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:33:58,037 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 3269 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 2067 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3462 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 7262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2067 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-22 21:33:58,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3462 Valid, 2854 Invalid, 7262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2067 Valid, 5191 Invalid, 4 Unknown, 0 Unchecked, 13.7s Time] [2023-11-22 21:33:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2023-11-22 21:33:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2440. [2023-11-22 21:33:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1576 states have (on average 1.3381979695431472) internal successors, (2109), 1627 states have internal predecessors, (2109), 714 states have call successors, (714), 135 states have call predecessors, (714), 134 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2023-11-22 21:33:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3535 transitions. [2023-11-22 21:33:58,184 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3535 transitions. Word has length 89 [2023-11-22 21:33:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:33:58,185 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3535 transitions. [2023-11-22 21:33:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 21:33:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3535 transitions. [2023-11-22 21:33:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-22 21:33:58,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:33:58,187 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:33:58,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 21:33:58,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:33:58,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:33:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1552924715, now seen corresponding path program 1 times [2023-11-22 21:33:58,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:33:58,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660868100] [2023-11-22 21:33:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:33:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:33:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:33:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:33:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:33:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:33:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:33:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:33:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:33:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:33:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:33:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:33:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:33:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:33:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:33:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:33:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:33:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 21:33:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:33:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-22 21:33:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:33:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-22 21:33:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:33:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660868100] [2023-11-22 21:33:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660868100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:33:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382585110] [2023-11-22 21:33:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:33:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:33:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:33:58,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:33:58,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:34:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:00,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 21:34:00,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:34:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-22 21:34:00,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:34:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382585110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:34:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 21:34:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205019100] [2023-11-22 21:34:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:34:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:34:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:34:00,340 INFO L87 Difference]: Start difference. First operand 2440 states and 3535 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-22 21:34:02,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:02,800 INFO L93 Difference]: Finished difference Result 3351 states and 4695 transitions. [2023-11-22 21:34:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:34:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 103 [2023-11-22 21:34:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:02,811 INFO L225 Difference]: With dead ends: 3351 [2023-11-22 21:34:02,812 INFO L226 Difference]: Without dead ends: 2434 [2023-11-22 21:34:02,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:34:02,817 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 1816 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:02,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 1643 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-11-22 21:34:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2023-11-22 21:34:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2023-11-22 21:34:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1571 states have (on average 1.336728198599618) internal successors, (2100), 1621 states have internal predecessors, (2100), 714 states have call successors, (714), 135 states have call predecessors, (714), 134 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2023-11-22 21:34:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3526 transitions. [2023-11-22 21:34:03,001 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3526 transitions. Word has length 103 [2023-11-22 21:34:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:03,001 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3526 transitions. [2023-11-22 21:34:03,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-22 21:34:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3526 transitions. [2023-11-22 21:34:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:34:03,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:03,003 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:34:03,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:34:03,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 21:34:03,216 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:34:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -960981695, now seen corresponding path program 1 times [2023-11-22 21:34:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606449633] [2023-11-22 21:34:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:34:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:34:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:34:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:34:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:34:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:34:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:34:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:34:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:34:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:34:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:34:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:34:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:34:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:34:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:34:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:34:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:34:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606449633] [2023-11-22 21:34:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606449633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:34:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811921444] [2023-11-22 21:34:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:34:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:34:03,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:34:03,955 INFO L87 Difference]: Start difference. First operand 2434 states and 3526 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 21:34:05,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:07,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:10,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:12,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:15,066 INFO L93 Difference]: Finished difference Result 2434 states and 3526 transitions. [2023-11-22 21:34:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:34:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 94 [2023-11-22 21:34:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:15,074 INFO L225 Difference]: With dead ends: 2434 [2023-11-22 21:34:15,074 INFO L226 Difference]: Without dead ends: 2432 [2023-11-22 21:34:15,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:34:15,075 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2575 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:15,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 2053 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2883 Invalid, 4 Unknown, 0 Unchecked, 10.9s Time] [2023-11-22 21:34:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-11-22 21:34:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2023-11-22 21:34:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 1570 states have (on average 1.3363057324840764) internal successors, (2098), 1619 states have internal predecessors, (2098), 714 states have call successors, (714), 135 states have call predecessors, (714), 134 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2023-11-22 21:34:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3524 transitions. [2023-11-22 21:34:15,202 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3524 transitions. Word has length 94 [2023-11-22 21:34:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:15,202 INFO L495 AbstractCegarLoop]: Abstraction has 2432 states and 3524 transitions. [2023-11-22 21:34:15,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 21:34:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3524 transitions. [2023-11-22 21:34:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:34:15,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:15,204 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:34:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:34:15,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:34:15,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash 89809861, now seen corresponding path program 1 times [2023-11-22 21:34:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112577103] [2023-11-22 21:34:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:34:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:34:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:34:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:34:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:34:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:34:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:34:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:34:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:34:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:34:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:34:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:34:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:34:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:34:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:34:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:34:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:34:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:34:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112577103] [2023-11-22 21:34:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112577103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:34:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581096314] [2023-11-22 21:34:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:15,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:34:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:34:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:34:15,980 INFO L87 Difference]: Start difference. First operand 2432 states and 3524 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-22 21:34:18,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:20,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:22,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:24,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:27,480 INFO L93 Difference]: Finished difference Result 2432 states and 3524 transitions. [2023-11-22 21:34:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:34:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 99 [2023-11-22 21:34:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:27,493 INFO L225 Difference]: With dead ends: 2432 [2023-11-22 21:34:27,493 INFO L226 Difference]: Without dead ends: 2430 [2023-11-22 21:34:27,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:34:27,495 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2569 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:27,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2053 Invalid, 4269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2879 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2023-11-22 21:34:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2023-11-22 21:34:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2023-11-22 21:34:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 1569 states have (on average 1.335882727852135) internal successors, (2096), 1617 states have internal predecessors, (2096), 714 states have call successors, (714), 135 states have call predecessors, (714), 134 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2023-11-22 21:34:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3522 transitions. [2023-11-22 21:34:27,659 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3522 transitions. Word has length 99 [2023-11-22 21:34:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:27,661 INFO L495 AbstractCegarLoop]: Abstraction has 2430 states and 3522 transitions. [2023-11-22 21:34:27,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-22 21:34:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3522 transitions. [2023-11-22 21:34:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 21:34:27,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:27,663 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:27,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 21:34:27,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:34:27,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash 915304248, now seen corresponding path program 1 times [2023-11-22 21:34:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087482567] [2023-11-22 21:34:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:34:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:34:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:34:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:34:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:34:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:34:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:34:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:34:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:34:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:34:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:34:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:34:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:34:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 21:34:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 21:34:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 21:34:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:34:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 21:34:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 21:34:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-22 21:34:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087482567] [2023-11-22 21:34:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087482567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 21:34:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982120867] [2023-11-22 21:34:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:28,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 21:34:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 21:34:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:34:28,881 INFO L87 Difference]: Start difference. First operand 2430 states and 3522 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-22 21:34:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:32,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:34,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:36,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:38,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:40,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:46,838 INFO L93 Difference]: Finished difference Result 2576 states and 3716 transitions. [2023-11-22 21:34:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 21:34:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 120 [2023-11-22 21:34:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:46,852 INFO L225 Difference]: With dead ends: 2576 [2023-11-22 21:34:46,852 INFO L226 Difference]: Without dead ends: 2574 [2023-11-22 21:34:46,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-22 21:34:46,854 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2751 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5386 mSolverCounterSat, 1772 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 7164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1772 IncrementalHoareTripleChecker+Valid, 5386 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:46,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 2976 Invalid, 7164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1772 Valid, 5386 Invalid, 6 Unknown, 0 Unchecked, 17.5s Time] [2023-11-22 21:34:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2023-11-22 21:34:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2562. [2023-11-22 21:34:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 1666 states have (on average 1.3343337334933973) internal successors, (2223), 1713 states have internal predecessors, (2223), 734 states have call successors, (734), 151 states have call predecessors, (734), 150 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2023-11-22 21:34:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3689 transitions. [2023-11-22 21:34:47,058 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3689 transitions. Word has length 120 [2023-11-22 21:34:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:47,058 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 3689 transitions. [2023-11-22 21:34:47,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-22 21:34:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3689 transitions. [2023-11-22 21:34:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 21:34:47,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:47,061 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:34:47,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 21:34:47,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:34:47,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -278510267, now seen corresponding path program 1 times [2023-11-22 21:34:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205508007] [2023-11-22 21:34:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:34:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:34:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:34:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:34:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:34:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:34:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:34:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:34:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:34:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:34:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:34:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:34:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:34:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:34:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:34:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:34:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:34:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:34:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:34:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:34:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:47,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205508007] [2023-11-22 21:34:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205508007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:34:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232931518] [2023-11-22 21:34:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:47,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:34:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:34:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:34:47,881 INFO L87 Difference]: Start difference. First operand 2562 states and 3689 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-22 21:34:49,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:51,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:53,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:55,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:34:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:59,690 INFO L93 Difference]: Finished difference Result 2562 states and 3689 transitions. [2023-11-22 21:34:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:34:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 104 [2023-11-22 21:34:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:59,699 INFO L225 Difference]: With dead ends: 2562 [2023-11-22 21:34:59,699 INFO L226 Difference]: Without dead ends: 2560 [2023-11-22 21:34:59,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:34:59,701 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2557 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:59,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2747 Valid, 2053 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2871 Invalid, 4 Unknown, 0 Unchecked, 11.5s Time] [2023-11-22 21:34:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-11-22 21:34:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2560. [2023-11-22 21:34:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1665 states have (on average 1.333933933933934) internal successors, (2221), 1711 states have internal predecessors, (2221), 734 states have call successors, (734), 151 states have call predecessors, (734), 150 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2023-11-22 21:34:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3687 transitions. [2023-11-22 21:34:59,881 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3687 transitions. Word has length 104 [2023-11-22 21:34:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:59,882 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3687 transitions. [2023-11-22 21:34:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-22 21:34:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3687 transitions. [2023-11-22 21:34:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-22 21:34:59,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:59,885 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:34:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 21:34:59,885 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:34:59,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1349960873, now seen corresponding path program 1 times [2023-11-22 21:34:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:59,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110411573] [2023-11-22 21:34:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:35:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:35:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:35:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:35:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:35:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:35:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:35:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:35:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:35:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:35:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:35:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:35:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:35:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:35:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:35:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:35:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:35:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:35:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:35:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:35:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:35:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:35:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110411573] [2023-11-22 21:35:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110411573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:35:00,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:35:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:35:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824346556] [2023-11-22 21:35:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:35:00,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:35:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:35:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:35:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:35:00,652 INFO L87 Difference]: Start difference. First operand 2560 states and 3687 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-22 21:35:02,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:04,690 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-22 21:35:06,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:08,730 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-22 21:35:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:35:12,204 INFO L93 Difference]: Finished difference Result 2560 states and 3687 transitions. [2023-11-22 21:35:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:35:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 109 [2023-11-22 21:35:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:35:12,231 INFO L225 Difference]: With dead ends: 2560 [2023-11-22 21:35:12,231 INFO L226 Difference]: Without dead ends: 2558 [2023-11-22 21:35:12,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:35:12,233 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2551 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2740 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:35:12,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2740 Valid, 2053 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2867 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2023-11-22 21:35:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2023-11-22 21:35:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2023-11-22 21:35:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 1664 states have (on average 1.3335336538461537) internal successors, (2219), 1709 states have internal predecessors, (2219), 734 states have call successors, (734), 151 states have call predecessors, (734), 150 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2023-11-22 21:35:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3685 transitions. [2023-11-22 21:35:12,421 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3685 transitions. Word has length 109 [2023-11-22 21:35:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:35:12,421 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3685 transitions. [2023-11-22 21:35:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-22 21:35:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3685 transitions. [2023-11-22 21:35:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-22 21:35:12,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:35:12,424 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:35:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 21:35:12,424 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:35:12,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:35:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 236176964, now seen corresponding path program 1 times [2023-11-22 21:35:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:35:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833685468] [2023-11-22 21:35:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:35:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:35:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:35:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:35:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:35:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:35:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:35:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:35:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:35:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:35:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:35:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:35:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:35:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:35:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:35:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:35:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:35:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:35:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:35:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:35:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:35:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 21:35:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:35:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:35:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833685468] [2023-11-22 21:35:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833685468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:35:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:35:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:35:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141216922] [2023-11-22 21:35:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:35:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:35:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:35:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:35:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:35:13,218 INFO L87 Difference]: Start difference. First operand 2558 states and 3685 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-22 21:35:15,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:17,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:19,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:21,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:35:25,137 INFO L93 Difference]: Finished difference Result 2558 states and 3685 transitions. [2023-11-22 21:35:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:35:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 114 [2023-11-22 21:35:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:35:25,144 INFO L225 Difference]: With dead ends: 2558 [2023-11-22 21:35:25,144 INFO L226 Difference]: Without dead ends: 2556 [2023-11-22 21:35:25,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:35:25,145 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2545 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-11-22 21:35:25,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2053 Invalid, 4253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2863 Invalid, 4 Unknown, 0 Unchecked, 11.6s Time] [2023-11-22 21:35:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2023-11-22 21:35:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2556. [2023-11-22 21:35:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 1663 states have (on average 1.333132892363199) internal successors, (2217), 1707 states have internal predecessors, (2217), 734 states have call successors, (734), 151 states have call predecessors, (734), 150 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2023-11-22 21:35:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3683 transitions. [2023-11-22 21:35:25,346 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3683 transitions. Word has length 114 [2023-11-22 21:35:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:35:25,347 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3683 transitions. [2023-11-22 21:35:25,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-22 21:35:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3683 transitions. [2023-11-22 21:35:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-22 21:35:25,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:35:25,349 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-11-22 21:35:25,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 21:35:25,349 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:35:25,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:35:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1965592379, now seen corresponding path program 1 times [2023-11-22 21:35:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:35:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650087018] [2023-11-22 21:35:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:35:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:35:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:35:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:35:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:35:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:35:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:35:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:35:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:35:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:35:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:35:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:35:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:35:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:35:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:35:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:35:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:35:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:35:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:35:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:35:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:35:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 21:35:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 21:35:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:35:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:35:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650087018] [2023-11-22 21:35:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650087018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:35:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:35:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:35:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219276029] [2023-11-22 21:35:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:35:26,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:35:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:35:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:35:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:35:26,210 INFO L87 Difference]: Start difference. First operand 2556 states and 3683 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-22 21:35:28,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:30,248 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-22 21:35:32,262 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-22 21:35:34,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:35:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:35:37,773 INFO L93 Difference]: Finished difference Result 2556 states and 3683 transitions. [2023-11-22 21:35:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:35:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 119 [2023-11-22 21:35:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:35:37,778 INFO L225 Difference]: With dead ends: 2556 [2023-11-22 21:35:37,778 INFO L226 Difference]: Without dead ends: 2554 [2023-11-22 21:35:37,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:35:37,779 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2539 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 4249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:35:37,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 2053 Invalid, 4249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2859 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2023-11-22 21:35:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2023-11-22 21:35:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2023-11-22 21:35:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1662 states have (on average 1.3327316486161251) internal successors, (2215), 1705 states have internal predecessors, (2215), 734 states have call successors, (734), 151 states have call predecessors, (734), 150 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2023-11-22 21:35:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3681 transitions. [2023-11-22 21:35:37,945 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3681 transitions. Word has length 119 [2023-11-22 21:35:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:35:37,946 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3681 transitions. [2023-11-22 21:35:37,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-22 21:35:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3681 transitions. [2023-11-22 21:35:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-22 21:35:37,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:35:37,948 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:35:37,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 21:35:37,948 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:35:37,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:35:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1001892480, now seen corresponding path program 1 times [2023-11-22 21:35:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:35:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400386011] [2023-11-22 21:35:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:35:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:35:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:35:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 21:35:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:35:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:35:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:35:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:35:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 21:35:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:35:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 21:35:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:35:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 21:35:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 21:35:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:35:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 21:35:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:35:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:35:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:35:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:35:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:35:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:35:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 21:35:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 21:35:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-22 21:35:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:35:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:35:38,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:35:38,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400386011] [2023-11-22 21:35:38,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400386011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:35:38,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:35:38,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:35:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148740405] [2023-11-22 21:35:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:35:38,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:35:38,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:35:38,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:35:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:35:38,749 INFO L87 Difference]: Start difference. First operand 2554 states and 3681 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Killed by 15