./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 false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-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 false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 20:53:12,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 20:53:13,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 20:53:13,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 20:53:13,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 20:53:13,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 20:53:13,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 20:53:13,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 20:53:13,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 20:53:13,086 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 20:53:13,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 20:53:13,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 20:53:13,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 20:53:13,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 20:53:13,089 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 20:53:13,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 20:53:13,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 20:53:13,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 20:53:13,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 20:53:13,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 20:53:13,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 20:53:13,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 20:53:13,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 20:53:13,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 20:53:13,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 20:53:13,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 20:53:13,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 20:53:13,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 20:53:13,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:53:13,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 20:53:13,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 20:53:13,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 20:53:13,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 20:53:13,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 20:53:13,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 20:53:13,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 20:53:13,094 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 20:53:13,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 20:53:13,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 20:53:13,094 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 -> false [2023-11-22 20:53:13,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 20:53:13,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 20:53:13,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 20:53:13,339 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 20:53:13,339 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 20:53:13,340 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 20:53:14,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 20:53:14,897 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 20:53:14,897 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 20:53:14,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a171181/7a51f30f195449a3be94d5816be6628f/FLAGcfe6f7657 [2023-11-22 20:53:14,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a171181/7a51f30f195449a3be94d5816be6628f [2023-11-22 20:53:14,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 20:53:14,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 20:53:14,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 20:53:14,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 20:53:14,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 20:53:14,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:53:14" (1/1) ... [2023-11-22 20:53:14,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b03e8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:14, skipping insertion in model container [2023-11-22 20:53:14,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:53:14" (1/1) ... [2023-11-22 20:53:15,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 20:53:17,393 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2023-11-22 20:53:17,396 WARN 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 20:53:17,397 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2023-11-22 20:53:17,397 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2023-11-22 20:53:17,397 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2023-11-22 20:53:17,397 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2023-11-22 20:53:17,398 WARN 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 20:53:17,398 WARN 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 20:53:17,398 WARN 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 20:53:17,399 WARN 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 20:53:17,399 WARN 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 20:53:17,399 WARN 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 20:53:17,399 WARN 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 20:53:17,400 WARN 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 20:53:17,400 WARN 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 20:53:17,400 WARN 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 20:53:17,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2023-11-22 20:53:17,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2023-11-22 20:53:17,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2023-11-22 20:53:17,402 WARN 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 20:53:17,402 WARN 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 20:53:17,402 WARN 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 20:53:17,403 WARN 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 20:53:17,403 WARN 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 20:53:17,403 WARN 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 20:53:17,404 WARN 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 20:53:17,404 WARN 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 20:53:17,404 WARN 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 20:53:17,404 WARN 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 20:53:17,405 WARN 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 20:53:17,405 WARN 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 20:53:17,405 WARN 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 20:53:17,406 WARN 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 20:53:17,406 WARN 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 20:53:17,406 WARN 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 20:53:17,406 WARN 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 20:53:17,407 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2023-11-22 20:53:17,407 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2023-11-22 20:53:17,407 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2023-11-22 20:53:17,408 WARN 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 20:53:17,408 WARN 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 20:53:17,408 WARN 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 20:53:17,409 WARN 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 20:53:17,409 WARN 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 20:53:17,409 WARN 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 20:53:17,409 WARN 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 20:53:17,410 WARN 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 20:53:17,410 WARN 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 20:53:17,410 WARN 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 20:53:17,411 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2023-11-22 20:53:17,411 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2023-11-22 20:53:17,411 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2023-11-22 20:53:17,411 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2023-11-22 20:53:17,412 WARN 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 20:53:17,412 WARN 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 20:53:17,412 WARN 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 20:53:17,413 WARN 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 20:53:17,413 WARN 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 20:53:17,413 WARN 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 20:53:17,413 WARN 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 20:53:17,414 WARN 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 20:53:17,414 WARN 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 20:53:17,415 WARN 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 20:53:17,415 WARN 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 20:53:17,415 WARN 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 20:53:17,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2023-11-22 20:53:17,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2023-11-22 20:53:17,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2023-11-22 20:53:17,417 WARN 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 20:53:17,417 WARN 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 20:53:17,418 WARN 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 20:53:17,419 WARN 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 20:53:17,419 WARN 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 20:53:17,419 WARN 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 20:53:17,420 WARN 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 20:53:17,421 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2023-11-22 20:53:17,421 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2023-11-22 20:53:17,421 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.0-rc1-mav-todo/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2023-11-22 20:53:17,422 WARN 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 20:53:17,422 WARN 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 20:53:17,423 WARN 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 20:53:17,424 WARN 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 20:53:17,424 WARN 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 20:53:17,424 WARN 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 20:53:17,424 WARN 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 20:53:17,425 WARN 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 20:53:17,425 WARN 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 20:53:17,425 WARN 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 20:53:17,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:53:17,464 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 20:53:17,537 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 20:53:17,539 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 20:53:17,539 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 20:53:17,539 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 20:53:17,694 WARN 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 20:53:17,695 WARN 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 20:53:17,695 WARN 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 20:53:17,696 WARN 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 20:53:17,699 WARN 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 20:53:17,700 WARN 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 20:53:17,700 WARN 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 20:53:17,700 WARN 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 20:53:17,701 WARN 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 20:53:17,701 WARN 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 20:53:17,701 WARN 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 20:53:17,702 WARN 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 20:53:17,702 WARN 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 20:53:17,703 WARN 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 20:53:17,703 WARN 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 20:53:17,703 WARN 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 20:53:17,704 WARN 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 20:53:17,706 WARN 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 20:53:17,707 WARN 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 20:53:17,707 WARN 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 20:53:17,708 WARN 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 20:53:17,708 WARN 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 20:53:17,708 WARN 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 20:53:17,708 WARN 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 20:53:17,709 WARN 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 20:53:17,709 WARN 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 20:53:17,709 WARN 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 20:53:17,709 WARN 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 20:53:17,710 WARN 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 20:53:17,710 WARN 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 20:53:17,710 WARN 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 20:53:17,711 WARN 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 20:53:17,712 WARN 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 20:53:17,712 WARN 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 20:53:17,713 WARN 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 20:53:17,713 WARN 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 20:53:17,714 WARN 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 20:53:17,714 WARN 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 20:53:17,714 WARN 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 20:53:17,715 WARN 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 20:53:17,715 WARN 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 20:53:17,716 WARN 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 20:53:17,716 WARN 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 20:53:17,717 WARN 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 20:53:17,717 WARN 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 20:53:17,717 WARN 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 20:53:17,717 WARN 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 20:53:17,718 WARN 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 20:53:17,718 WARN 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 20:53:17,718 WARN 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 20:53:17,719 WARN 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 20:53:17,719 WARN 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 20:53:17,719 WARN 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 20:53:17,719 WARN 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 20:53:17,720 WARN 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 20:53:17,720 WARN 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 20:53:17,720 WARN 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 20:53:17,721 WARN 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 20:53:17,722 WARN 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 20:53:17,722 WARN 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 20:53:17,722 WARN 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 20:53:17,722 WARN 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 20:53:17,723 WARN 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 20:53:17,723 WARN 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 20:53:17,724 WARN 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 20:53:17,724 WARN 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 20:53:17,725 WARN 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 20:53:17,725 WARN 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 20:53:17,731 WARN 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 20:53:17,732 WARN 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 20:53:17,732 WARN 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 20:53:17,733 WARN 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 20:53:17,733 WARN 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 20:53:17,733 WARN 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 20:53:17,733 WARN 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 20:53:17,734 WARN 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 20:53:17,734 WARN 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 20:53:17,734 WARN 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 20:53:17,735 WARN 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 20:53:17,736 WARN 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 20:53:17,736 WARN 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 20:53:17,736 WARN 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 20:53:17,737 WARN 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 20:53:17,737 WARN 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 20:53:17,737 WARN 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 20:53:17,737 WARN 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 20:53:17,738 WARN 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 20:53:17,738 WARN 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 20:53:17,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:53:17,887 WARN L675 CHandler]: The function __cmpxchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 20:53:17,893 INFO L206 MainTranslator]: Completed translation [2023-11-22 20:53:17,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17 WrapperNode [2023-11-22 20:53:17,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 20:53:17,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 20:53:17,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 20:53:17,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 20:53:17,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:17,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,106 INFO L138 Inliner]: procedures = 591, calls = 1851, calls flagged for inlining = 314, calls inlined = 232, statements flattened = 4669 [2023-11-22 20:53:18,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 20:53:18,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 20:53:18,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 20:53:18,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 20:53:18,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 20:53:18,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 20:53:18,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 20:53:18,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 20:53:18,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (1/1) ... [2023-11-22 20:53:18,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:53:18,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:53:18,362 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 20:53:18,379 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 20:53:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 20:53:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 20:53:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-22 20:53:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-22 20:53:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 20:53:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 20:53:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-22 20:53:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-22 20:53:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 20:53:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 20:53:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_unregister [2023-11-22 20:53:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_unregister [2023-11-22 20:53:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-22 20:53:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-22 20:53:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-22 20:53:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-22 20:53:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_get_drvdata [2023-11-22 20:53:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_get_drvdata [2023-11-22 20:53:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-22 20:53:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-22 20:53:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 20:53:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_poll [2023-11-22 20:53:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_poll [2023-11-22 20:53:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_put_noidle [2023-11-22 20:53:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_put_noidle [2023-11-22 20:53:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-22 20:53:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-22 20:53:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2023-11-22 20:53:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2023-11-22 20:53:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-22 20:53:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-22 20:53:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-22 20:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 20:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 20:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 20:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 20:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 20:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2023-11-22 20:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2023-11-22 20:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 20:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 20:53:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2023-11-22 20:53:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2023-11-22 20:53:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_resume [2023-11-22 20:53:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_resume [2023-11-22 20:53:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure iio_priv [2023-11-22 20:53:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_priv [2023-11-22 20:53:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 20:53:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 20:53:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2023-11-22 20:53:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2023-11-22 20:53:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 20:53:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 20:53:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 20:53:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_acc_reg [2023-11-22 20:53:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_acc_reg [2023-11-22 20:53:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_mode [2023-11-22 20:53:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_mode [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-22 20:53:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 20:53:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-22 20:53:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-22 20:53:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure iio_push_event [2023-11-22 20:53:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_push_event [2023-11-22 20:53:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 20:53:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 20:53:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2023-11-22 20:53:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2023-11-22 20:53:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2023-11-22 20:53:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2023-11-22 20:53:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 20:53:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 20:53:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2023-11-22 20:53:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_trig_try_reen [2023-11-22 20:53:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_trig_try_reen [2023-11-22 20:53:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-22 20:53:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-22 20:53:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_remove [2023-11-22 20:53:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_remove [2023-11-22 20:53:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2023-11-22 20:53:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_range [2023-11-22 20:53:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_range [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-22 20:53:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 20:53:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_register [2023-11-22 20:53:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_register [2023-11-22 20:53:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 20:53:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 20:53:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2023-11-22 20:53:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2023-11-22 20:53:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_read_byte_data [2023-11-22 20:53:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_read_byte_data [2023-11-22 20:53:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 20:53:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure iio_triggered_buffer_cleanup [2023-11-22 20:53:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_triggered_buffer_cleanup [2023-11-22 20:53:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_suspend [2023-11-22 20:53:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_suspend [2023-11-22 20:53:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-22 20:53:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-22 20:53:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 20:53:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-22 20:53:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-22 20:53:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 20:53:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 20:53:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_power_state [2023-11-22 20:53:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_power_state [2023-11-22 20:53:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-22 20:53:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-22 20:53:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_set_drvdata [2023-11-22 20:53:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_set_drvdata [2023-11-22 20:53:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_register [2023-11-22 20:53:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_register [2023-11-22 20:53:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 20:53:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 20:53:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure __pm_runtime_set_status [2023-11-22 20:53:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __pm_runtime_set_status [2023-11-22 20:53:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 20:53:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 20:53:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 20:53:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 20:53:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_unregister [2023-11-22 20:53:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_unregister [2023-11-22 20:53:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 20:53:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 20:53:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure iio_device_unregister [2023-11-22 20:53:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_device_unregister [2023-11-22 20:53:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 20:53:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 20:53:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_setup_any_motion_interrupt [2023-11-22 20:53:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_setup_any_motion_interrupt [2023-11-22 20:53:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_triggered_buffer_cleanup [2023-11-22 20:53:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_triggered_buffer_cleanup [2023-11-22 20:53:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 20:53:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 20:53:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 20:53:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure devm_iio_trigger_alloc [2023-11-22 20:53:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_iio_trigger_alloc [2023-11-22 20:53:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-22 20:53:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-22 20:53:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 20:53:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 20:53:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_mode [2023-11-22 20:53:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_mode [2023-11-22 20:53:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_resume [2023-11-22 20:53:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_resume [2023-11-22 20:53:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-22 20:53:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-22 20:53:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 20:53:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 20:53:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_suspend [2023-11-22 20:53:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_suspend [2023-11-22 20:53:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 20:53:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_write_byte_data [2023-11-22 20:53:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_write_byte_data [2023-11-22 20:53:18,985 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 20:53:18,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 20:53:19,074 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-22 20:53:22,967 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 20:53:23,168 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 20:53:23,168 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 20:53:23,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:53:23 BoogieIcfgContainer [2023-11-22 20:53:23,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 20:53:23,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 20:53:23,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 20:53:23,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 20:53:23,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:53:14" (1/3) ... [2023-11-22 20:53:23,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491ce84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:53:23, skipping insertion in model container [2023-11-22 20:53:23,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:17" (2/3) ... [2023-11-22 20:53:23,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491ce84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:53:23, skipping insertion in model container [2023-11-22 20:53:23,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:53:23" (3/3) ... [2023-11-22 20:53:23,175 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2023-11-22 20:53:23,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 20:53:23,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-22 20:53:23,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 20:53:23,243 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;@600da998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 20:53:23,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-22 20:53:23,250 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 20:53:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 20:53:23,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:23,258 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 20:53:23,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:53:23,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1530686498, now seen corresponding path program 1 times [2023-11-22 20:53:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323722970] [2023-11-22 20:53:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:53:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:53:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:53:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:53:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:53:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:53:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:53:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:24,587 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 20:53:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:24,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323722970] [2023-11-22 20:53:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323722970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:24,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:24,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119363613] [2023-11-22 20:53:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:24,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:24,621 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 20:53:26,671 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 20:53:28,686 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 20:53:30,692 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 20:53:32,696 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 20:53:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:37,115 INFO L93 Difference]: Finished difference Result 2603 states and 3922 transitions. [2023-11-22 20:53:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:53:37,117 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 20:53:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:37,140 INFO L225 Difference]: With dead ends: 2603 [2023-11-22 20:53:37,140 INFO L226 Difference]: Without dead ends: 1297 [2023-11-22 20:53:37,155 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 20:53:37,159 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 2667 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 1399 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 4344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1399 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:37,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 2123 Invalid, 4344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1399 Valid, 2941 Invalid, 4 Unknown, 0 Unchecked, 12.1s Time] [2023-11-22 20:53:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2023-11-22 20:53:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2023-11-22 20:53:37,304 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 20:53:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1853 transitions. [2023-11-22 20:53:37,314 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1853 transitions. Word has length 47 [2023-11-22 20:53:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:37,315 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1853 transitions. [2023-11-22 20:53:37,316 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 20:53:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1853 transitions. [2023-11-22 20:53:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 20:53:37,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:37,318 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 20:53:37,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 20:53:37,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:53:37,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 978262363, now seen corresponding path program 1 times [2023-11-22 20:53:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117223187] [2023-11-22 20:53:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:53:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:53:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:53:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:53:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:53:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:53:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:53:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,249 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 20:53:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117223187] [2023-11-22 20:53:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117223187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:38,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232819003] [2023-11-22 20:53:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:38,253 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 20:53:40,285 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 20:53:42,290 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 20:53:44,302 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 20:53:46,333 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 20:53:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:50,294 INFO L93 Difference]: Finished difference Result 1297 states and 1853 transitions. [2023-11-22 20:53:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:53:50,294 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 20:53:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:50,300 INFO L225 Difference]: With dead ends: 1297 [2023-11-22 20:53:50,300 INFO L226 Difference]: Without dead ends: 1295 [2023-11-22 20:53:50,301 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 20:53:50,301 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2633 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s 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.8s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:50,301 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.8s Time] [2023-11-22 20:53:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-11-22 20:53:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2023-11-22 20:53:50,347 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 20:53:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1851 transitions. [2023-11-22 20:53:50,355 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1851 transitions. Word has length 52 [2023-11-22 20:53:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:50,355 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1851 transitions. [2023-11-22 20:53:50,355 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 20:53:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1851 transitions. [2023-11-22 20:53:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 20:53:50,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:50,362 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 20:53:50,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 20:53:50,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:53:50,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 752498140, now seen corresponding path program 1 times [2023-11-22 20:53:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999098766] [2023-11-22 20:53:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:53:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:53:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:53:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:53:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:53:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:53:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:53:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:53:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,258 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 20:53:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999098766] [2023-11-22 20:53:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999098766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059600905] [2023-11-22 20:53:51,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:51,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:51,273 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 20:53:53,300 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 20:53:55,332 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 20:53:57,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 20:53:59,391 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 20:54:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:54:03,482 INFO L93 Difference]: Finished difference Result 1295 states and 1851 transitions. [2023-11-22 20:54:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:54:03,483 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 20:54:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:54:03,489 INFO L225 Difference]: With dead ends: 1295 [2023-11-22 20:54:03,489 INFO L226 Difference]: Without dead ends: 1293 [2023-11-22 20:54:03,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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 20:54:03,491 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2627 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s 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, 12.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:54:03,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2826 Valid, 2091 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2913 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2023-11-22 20:54:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2023-11-22 20:54:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2023-11-22 20:54:03,557 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 20:54:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1849 transitions. [2023-11-22 20:54:03,563 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1849 transitions. Word has length 57 [2023-11-22 20:54:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:54:03,565 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1849 transitions. [2023-11-22 20:54:03,565 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 20:54:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1849 transitions. [2023-11-22 20:54:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 20:54:03,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:54:03,568 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 20:54:03,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 20:54:03,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:54:03,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:54:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1770594667, now seen corresponding path program 1 times [2023-11-22 20:54:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:54:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788498397] [2023-11-22 20:54:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:54:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:54:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:54:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:54:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:54:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:54:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:54:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:54:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:54:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:54:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:54:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:54:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:04,494 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 20:54:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:54:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788498397] [2023-11-22 20:54:04,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788498397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:54:04,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:54:04,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:54:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054640485] [2023-11-22 20:54:04,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:54:04,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:54:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:54:04,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:54:04,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:54:04,496 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 20:54:06,522 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 20:54:08,549 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 20:54:10,557 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 20:54:12,565 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 20:54:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:54:16,469 INFO L93 Difference]: Finished difference Result 1293 states and 1849 transitions. [2023-11-22 20:54:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:54:16,470 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 20:54:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:54:16,518 INFO L225 Difference]: With dead ends: 1293 [2023-11-22 20:54:16,518 INFO L226 Difference]: Without dead ends: 1291 [2023-11-22 20:54:16,519 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 20:54:16,521 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2621 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s 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.8s IncrementalHoareTripleChecker+Time [2023-11-22 20:54:16,522 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.8s Time] [2023-11-22 20:54:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2023-11-22 20:54:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2023-11-22 20:54:16,573 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 20:54:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1847 transitions. [2023-11-22 20:54:16,579 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1847 transitions. Word has length 62 [2023-11-22 20:54:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:54:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1847 transitions. [2023-11-22 20:54:16,580 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 20:54:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1847 transitions. [2023-11-22 20:54:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 20:54:16,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:54:16,582 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 20:54:16,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 20:54:16,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:54:16,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:54:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1040441169, now seen corresponding path program 1 times [2023-11-22 20:54:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:54:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087454534] [2023-11-22 20:54:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:54:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:54:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:54:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:54:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:54:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:54:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:54:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:54:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:54:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:54:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:54:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:54:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:54:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:17,397 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 20:54:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:54:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087454534] [2023-11-22 20:54:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087454534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:54:17,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:54:17,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:54:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56030845] [2023-11-22 20:54:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:54:17,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:54:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:54:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:54:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:54:17,400 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 20:54:19,425 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 20:54:21,435 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 20:54:23,460 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 20:54:25,481 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 20:54:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:54:28,635 INFO L93 Difference]: Finished difference Result 1291 states and 1847 transitions. [2023-11-22 20:54:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:54:28,636 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 20:54:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:54:28,640 INFO L225 Difference]: With dead ends: 1291 [2023-11-22 20:54:28,640 INFO L226 Difference]: Without dead ends: 1289 [2023-11-22 20:54:28,641 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 20:54:28,641 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2615 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s 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.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:54:28,642 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.0s Time] [2023-11-22 20:54:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2023-11-22 20:54:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2023-11-22 20:54:28,686 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 20:54:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1845 transitions. [2023-11-22 20:54:28,691 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1845 transitions. Word has length 67 [2023-11-22 20:54:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:54:28,692 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1845 transitions. [2023-11-22 20:54:28,692 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 20:54:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1845 transitions. [2023-11-22 20:54:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 20:54:28,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:54:28,693 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 20:54:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 20:54:28,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:54:28,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:54:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 450480136, now seen corresponding path program 1 times [2023-11-22 20:54:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:54:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293222] [2023-11-22 20:54:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:54:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:54:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:54:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:54:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:54:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:54:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:54:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:54:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:54:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:54:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:54:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:54:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:54:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:54:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:29,555 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 20:54:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:54:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293222] [2023-11-22 20:54:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315293222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:54:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:54:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:54:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231571680] [2023-11-22 20:54:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:54:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:54:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:54:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:54:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:54:29,557 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 20:54:31,583 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 20:54:33,590 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 20:54:35,605 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 20:54:37,609 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 20:54:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:54:41,184 INFO L93 Difference]: Finished difference Result 1289 states and 1845 transitions. [2023-11-22 20:54:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:54:41,185 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 20:54:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:54:41,190 INFO L225 Difference]: With dead ends: 1289 [2023-11-22 20:54:41,190 INFO L226 Difference]: Without dead ends: 1287 [2023-11-22 20:54:41,190 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 20:54:41,190 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2609 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s 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.4s IncrementalHoareTripleChecker+Time [2023-11-22 20:54:41,191 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.4s Time] [2023-11-22 20:54:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2023-11-22 20:54:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2023-11-22 20:54:41,238 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 20:54:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1843 transitions. [2023-11-22 20:54:41,242 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1843 transitions. Word has length 72 [2023-11-22 20:54:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:54:41,244 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1843 transitions. [2023-11-22 20:54:41,244 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 20:54:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1843 transitions. [2023-11-22 20:54:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-22 20:54:41,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:54:41,245 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 20:54:41,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 20:54:41,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:54:41,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:54:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1689409431, now seen corresponding path program 1 times [2023-11-22 20:54:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:54:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536085263] [2023-11-22 20:54:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:54:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:54:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:54:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:54:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:54:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:54:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:41,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:54:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:54:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:54:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:54:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:54:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:54:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:54:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:54:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:54:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:42,051 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 20:54:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:54:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536085263] [2023-11-22 20:54:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536085263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:54:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:54:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:54:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450590210] [2023-11-22 20:54:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:54:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:54:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:54:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:54:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:54:42,053 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 20:54:44,093 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 20:54:46,108 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 20:54:48,125 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 20:54:50,155 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 20:54:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:54:53,506 INFO L93 Difference]: Finished difference Result 1287 states and 1843 transitions. [2023-11-22 20:54:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:54:53,506 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 20:54:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:54:53,539 INFO L225 Difference]: With dead ends: 1287 [2023-11-22 20:54:53,539 INFO L226 Difference]: Without dead ends: 1285 [2023-11-22 20:54:53,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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 20:54:53,541 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2603 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s 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.3s IncrementalHoareTripleChecker+Time [2023-11-22 20:54:53,541 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.3s Time] [2023-11-22 20:54:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2023-11-22 20:54:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2023-11-22 20:54:53,625 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 20:54:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1841 transitions. [2023-11-22 20:54:53,639 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1841 transitions. Word has length 77 [2023-11-22 20:54:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:54:53,639 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1841 transitions. [2023-11-22 20:54:53,639 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 20:54:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1841 transitions. [2023-11-22 20:54:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-22 20:54:53,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:54:53,641 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 20:54:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 20:54:53,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:54:53,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:54:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 801660270, now seen corresponding path program 1 times [2023-11-22 20:54:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:54:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337104529] [2023-11-22 20:54:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:54:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:54:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:54:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:54:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:54:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:54:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:54:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:54:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:54:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:54:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:54:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:54:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:54:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:54:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:54:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:54:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:54:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:54:54,658 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 20:54:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:54:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337104529] [2023-11-22 20:54:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337104529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:54:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:54:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:54:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269597663] [2023-11-22 20:54:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:54:54,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:54:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:54:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:54:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:54:54,661 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 20:54:56,688 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 20:54:58,731 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 20:55:00,751 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 20:55:02,781 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 20:55:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:06,501 INFO L93 Difference]: Finished difference Result 1285 states and 1841 transitions. [2023-11-22 20:55:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:55:06,516 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 20:55:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:06,522 INFO L225 Difference]: With dead ends: 1285 [2023-11-22 20:55:06,522 INFO L226 Difference]: Without dead ends: 1283 [2023-11-22 20:55:06,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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 20:55:06,524 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2597 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s 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.6s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:06,524 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.6s Time] [2023-11-22 20:55:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-22 20:55:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2023-11-22 20:55:06,575 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 20:55:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1839 transitions. [2023-11-22 20:55:06,579 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1839 transitions. Word has length 82 [2023-11-22 20:55:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:06,580 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1839 transitions. [2023-11-22 20:55:06,580 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 20:55:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1839 transitions. [2023-11-22 20:55:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-22 20:55:06,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:06,582 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 20:55:06,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 20:55:06,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:55:06,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1596510001, now seen corresponding path program 1 times [2023-11-22 20:55:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:06,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204672576] [2023-11-22 20:55:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:55:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:55:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:55:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:55:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:55:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:55:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:55:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:55:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:55:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:55:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:55:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:55:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:55:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:07,428 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 20:55:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:07,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204672576] [2023-11-22 20:55:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204672576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:07,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:07,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:55:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439039472] [2023-11-22 20:55:07,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:07,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:55:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:55:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:55:07,431 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 20:55:09,473 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 20:55:11,494 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 20:55:13,523 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 20:55:15,548 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 20:55:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:19,208 INFO L93 Difference]: Finished difference Result 1283 states and 1839 transitions. [2023-11-22 20:55:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:55:19,208 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 20:55:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:19,213 INFO L225 Difference]: With dead ends: 1283 [2023-11-22 20:55:19,214 INFO L226 Difference]: Without dead ends: 1281 [2023-11-22 20:55:19,214 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 20:55:19,214 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2589 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s 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.6s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:19,215 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.6s Time] [2023-11-22 20:55:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2023-11-22 20:55:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1281. [2023-11-22 20:55:19,306 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 20:55:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1837 transitions. [2023-11-22 20:55:19,309 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1837 transitions. Word has length 84 [2023-11-22 20:55:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:19,310 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1837 transitions. [2023-11-22 20:55:19,310 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 20:55:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1837 transitions. [2023-11-22 20:55:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-22 20:55:19,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:19,312 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 20:55:19,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 20:55:19,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:55:19,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -466312394, now seen corresponding path program 1 times [2023-11-22 20:55:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521368191] [2023-11-22 20:55:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:55:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:55:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:55:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:55:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:55:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:55:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 20:55:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 20:55:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:55:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:55:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 20:55:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 20:55:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:55:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:55:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 20:55:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 20:55:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:20,155 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 20:55:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521368191] [2023-11-22 20:55:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521368191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:20,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:55:20,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634509036] [2023-11-22 20:55:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:20,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:55:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:55:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:55:20,157 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 20:55:22,184 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 20:55:24,189 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 20:55:26,202 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 20:55:28,241 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 20:55:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:31,804 INFO L93 Difference]: Finished difference Result 1787 states and 2473 transitions. [2023-11-22 20:55:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 20:55:31,805 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 20:55:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:31,809 INFO L225 Difference]: With dead ends: 1787 [2023-11-22 20:55:31,809 INFO L226 Difference]: Without dead ends: 1283 [2023-11-22 20:55:31,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 20:55:31,811 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 2910 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 1828 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s 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.5s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:31,813 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.5s Time] [2023-11-22 20:55:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-22 20:55:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1277. [2023-11-22 20:55:31,874 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 20:55:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1832 transitions. [2023-11-22 20:55:31,878 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1832 transitions. Word has length 98 [2023-11-22 20:55:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:31,879 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 1832 transitions. [2023-11-22 20:55:31,879 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 20:55:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1832 transitions. [2023-11-22 20:55:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-22 20:55:31,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:31,880 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 20:55:31,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 20:55:31,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:55:31,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2084091518, now seen corresponding path program 1 times [2023-11-22 20:55:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891477011] [2023-11-22 20:55:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:55:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:55:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:55:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:55:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:55:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:55:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:55:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:55:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:55:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:55:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:55:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:55:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:55:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:55:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:32,658 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 20:55:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891477011] [2023-11-22 20:55:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891477011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:32,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:32,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:55:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690454672] [2023-11-22 20:55:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:32,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:55:32,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:32,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:55:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:55:32,660 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 20:55:34,688 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 20:55:36,691 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 20:55:38,695 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 20:55:40,723 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 20:55:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:47,129 INFO L93 Difference]: Finished difference Result 2536 states and 3636 transitions. [2023-11-22 20:55:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 20:55:47,130 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 20:55:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:47,138 INFO L225 Difference]: With dead ends: 2536 [2023-11-22 20:55:47,139 INFO L226 Difference]: Without dead ends: 2534 [2023-11-22 20:55:47,140 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 20:55:47,142 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 3273 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 5178 mSolverCounterSat, 2073 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3466 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 7255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2073 IncrementalHoareTripleChecker+Valid, 5178 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:47,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3466 Valid, 2845 Invalid, 7255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2073 Valid, 5178 Invalid, 4 Unknown, 0 Unchecked, 14.1s Time] [2023-11-22 20:55:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2023-11-22 20:55:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2440. [2023-11-22 20:55:47,302 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 20:55:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3535 transitions. [2023-11-22 20:55:47,310 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3535 transitions. Word has length 89 [2023-11-22 20:55:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:47,314 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3535 transitions. [2023-11-22 20:55:47,315 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 20:55:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3535 transitions. [2023-11-22 20:55:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-22 20:55:47,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:47,316 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 20:55:47,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 20:55:47,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:55:47,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash -5883687, now seen corresponding path program 1 times [2023-11-22 20:55:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:47,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317776137] [2023-11-22 20:55:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:55:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:55:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:55:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:55:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:55:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:55:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 20:55:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 20:55:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:55:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:55:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 20:55:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 20:55:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:55:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:55:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 20:55:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 20:55:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-22 20:55:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,132 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 20:55:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317776137] [2023-11-22 20:55:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317776137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340728788] [2023-11-22 20:55:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:48,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:48,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:48,176 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 20:55:48,204 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 20:55:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:49,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 20:55:49,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:49,607 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 20:55:49,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 20:55:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340728788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 20:55:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 20:55:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941445923] [2023-11-22 20:55:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:49,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 20:55:49,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:49,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 20:55:49,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 20:55:49,609 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 20:55:51,636 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 20:55:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:52,195 INFO L93 Difference]: Finished difference Result 3351 states and 4695 transitions. [2023-11-22 20:55:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 20:55:52,195 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 20:55:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:52,205 INFO L225 Difference]: With dead ends: 3351 [2023-11-22 20:55:52,206 INFO L226 Difference]: Without dead ends: 2434 [2023-11-22 20:55:52,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 20:55:52,210 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.4s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:52,210 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.4s Time] [2023-11-22 20:55:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2023-11-22 20:55:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2023-11-22 20:55:52,338 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 20:55:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3526 transitions. [2023-11-22 20:55:52,347 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3526 transitions. Word has length 103 [2023-11-22 20:55:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:52,347 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3526 transitions. [2023-11-22 20:55:52,348 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 20:55:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3526 transitions. [2023-11-22 20:55:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 20:55:52,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:52,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] [2023-11-22 20:55:52,387 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 20:55:52,564 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 20:55:52,564 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:55:52,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2126311305, now seen corresponding path program 1 times [2023-11-22 20:55:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319457671] [2023-11-22 20:55:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:55:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:55:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:55:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:55:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:55:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:55:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:55:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:55:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:55:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:55:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:55:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:55:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:55:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:55:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:55:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:55:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:53,380 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 20:55:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319457671] [2023-11-22 20:55:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319457671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:55:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599234387] [2023-11-22 20:55:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:55:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:55:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:55:53,382 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 20:55:55,421 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 20:55:57,449 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 20:55:59,457 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 20:56:01,500 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 20:56:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:05,923 INFO L93 Difference]: Finished difference Result 2434 states and 3526 transitions. [2023-11-22 20:56:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:56:05,924 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 20:56:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:05,931 INFO L225 Difference]: With dead ends: 2434 [2023-11-22 20:56:05,931 INFO L226 Difference]: Without dead ends: 2432 [2023-11-22 20:56:05,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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 20:56:05,933 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2575 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s 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, 12.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:05,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 2053 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2883 Invalid, 4 Unknown, 0 Unchecked, 12.2s Time] [2023-11-22 20:56:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-11-22 20:56:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2023-11-22 20:56:06,059 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 20:56:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3524 transitions. [2023-11-22 20:56:06,066 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3524 transitions. Word has length 94 [2023-11-22 20:56:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:06,066 INFO L495 AbstractCegarLoop]: Abstraction has 2432 states and 3524 transitions. [2023-11-22 20:56:06,066 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 20:56:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3524 transitions. [2023-11-22 20:56:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 20:56:06,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:06,068 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 20:56:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 20:56:06,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:56:06,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1936924828, now seen corresponding path program 1 times [2023-11-22 20:56:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134372524] [2023-11-22 20:56:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:56:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:56:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:56:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:56:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:56:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:56:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:56:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:56:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:56:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:56:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:56:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:56:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:56:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:56:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:56:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 20:56:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:06,928 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 20:56:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134372524] [2023-11-22 20:56:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134372524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:56:06,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:56:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:56:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531867046] [2023-11-22 20:56:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:56:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:56:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:56:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:56:06,930 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 20:56:08,957 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 20:56:10,976 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 20:56:12,989 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 20:56:15,031 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 20:56:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:19,187 INFO L93 Difference]: Finished difference Result 2432 states and 3524 transitions. [2023-11-22 20:56:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:56:19,187 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 20:56:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:19,228 INFO L225 Difference]: With dead ends: 2432 [2023-11-22 20:56:19,228 INFO L226 Difference]: Without dead ends: 2430 [2023-11-22 20:56:19,229 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 20:56:19,230 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2569 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s 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, 12.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:19,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2053 Invalid, 4269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2879 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2023-11-22 20:56:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2023-11-22 20:56:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2023-11-22 20:56:19,361 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 20:56:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3522 transitions. [2023-11-22 20:56:19,370 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3522 transitions. Word has length 99 [2023-11-22 20:56:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:19,370 INFO L495 AbstractCegarLoop]: Abstraction has 2430 states and 3522 transitions. [2023-11-22 20:56:19,371 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 20:56:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3522 transitions. [2023-11-22 20:56:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 20:56:19,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:19,373 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 20:56:19,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 20:56:19,373 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:56:19,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2133857305, now seen corresponding path program 1 times [2023-11-22 20:56:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643712353] [2023-11-22 20:56:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:56:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:56:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:56:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:56:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:56:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:56:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 20:56:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 20:56:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:56:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:56:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 20:56:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 20:56:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-22 20:56:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:56:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-22 20:56:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 20:56:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 20:56:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 20:56:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:20,664 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 20:56:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643712353] [2023-11-22 20:56:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643712353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:56:20,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:56:20,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 20:56:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265282400] [2023-11-22 20:56:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:56:20,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 20:56:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 20:56:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 20:56:20,667 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 20:56:22,697 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 20:56:24,738 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 20:56:26,771 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 20:56:28,797 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 20:56:30,810 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 20:56:32,845 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 20:56:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:38,280 INFO L93 Difference]: Finished difference Result 2576 states and 3716 transitions. [2023-11-22 20:56:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 20:56:38,281 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 20:56:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:38,297 INFO L225 Difference]: With dead ends: 2576 [2023-11-22 20:56:38,298 INFO L226 Difference]: Without dead ends: 2574 [2023-11-22 20:56:38,299 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 20:56:38,299 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2751 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5386 mSolverCounterSat, 1772 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:38,300 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.2s Time] [2023-11-22 20:56:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2023-11-22 20:56:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2562. [2023-11-22 20:56:38,475 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 20:56:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3689 transitions. [2023-11-22 20:56:38,481 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3689 transitions. Word has length 120 [2023-11-22 20:56:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:38,482 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 3689 transitions. [2023-11-22 20:56:38,482 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 20:56:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3689 transitions. [2023-11-22 20:56:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 20:56:38,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:38,484 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 20:56:38,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 20:56:38,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:56:38,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1522076349, now seen corresponding path program 1 times [2023-11-22 20:56:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281157515] [2023-11-22 20:56:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:56:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:56:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:56:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:56:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:56:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:56:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:56:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:56:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:56:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:56:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:56:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:56:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:56:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:56:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:56:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 20:56:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 20:56:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:39,309 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 20:56:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281157515] [2023-11-22 20:56:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281157515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:56:39,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:56:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:56:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333129896] [2023-11-22 20:56:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:56:39,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:56:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:56:39,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:56:39,311 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 20:56:41,344 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 20:56:43,348 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 20:56:45,365 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 20:56:47,401 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 20:56:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:51,248 INFO L93 Difference]: Finished difference Result 2562 states and 3689 transitions. [2023-11-22 20:56:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:56:51,248 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 20:56:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:51,257 INFO L225 Difference]: With dead ends: 2562 [2023-11-22 20:56:51,257 INFO L226 Difference]: Without dead ends: 2560 [2023-11-22 20:56:51,259 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 20:56:51,259 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2557 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s 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.6s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:51,259 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.6s Time] [2023-11-22 20:56:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-11-22 20:56:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2560. [2023-11-22 20:56:51,424 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 20:56:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3687 transitions. [2023-11-22 20:56:51,431 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3687 transitions. Word has length 104 [2023-11-22 20:56:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:51,432 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3687 transitions. [2023-11-22 20:56:51,432 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 20:56:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3687 transitions. [2023-11-22 20:56:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-22 20:56:51,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:51,435 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 20:56:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 20:56:51,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:56:51,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash -991360297, now seen corresponding path program 1 times [2023-11-22 20:56:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025976927] [2023-11-22 20:56:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:56:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:56:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:56:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:56:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:56:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:56:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:56:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:56:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:56:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:56:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:56:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:56:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:56:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:56:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:56:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:56:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 20:56:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 20:56:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 20:56:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:52,306 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 20:56:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025976927] [2023-11-22 20:56:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025976927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:56:52,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:56:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:56:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607778155] [2023-11-22 20:56:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:56:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:56:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:52,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:56:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:56:52,309 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 20:56:54,337 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 20:56:56,345 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 20:56:58,365 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 20:57:00,386 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 20:57:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:57:04,599 INFO L93 Difference]: Finished difference Result 2560 states and 3687 transitions. [2023-11-22 20:57:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:57:04,600 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 20:57:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:57:04,616 INFO L225 Difference]: With dead ends: 2560 [2023-11-22 20:57:04,616 INFO L226 Difference]: Without dead ends: 2558 [2023-11-22 20:57:04,617 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 20:57:04,618 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2551 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s 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, 12.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:57:04,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2740 Valid, 2053 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 2867 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2023-11-22 20:57:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2023-11-22 20:57:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2023-11-22 20:57:04,847 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 20:57:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3685 transitions. [2023-11-22 20:57:04,854 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3685 transitions. Word has length 109 [2023-11-22 20:57:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:57:04,855 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3685 transitions. [2023-11-22 20:57:04,855 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 20:57:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3685 transitions. [2023-11-22 20:57:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-22 20:57:04,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:57:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:04,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 20:57:04,858 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:57:04,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:57:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash -403058237, now seen corresponding path program 1 times [2023-11-22 20:57:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:57:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313111538] [2023-11-22 20:57:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:57:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:57:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:57:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:57:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:57:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:57:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:57:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:57:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:57:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:57:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:57:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:57:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:57:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:57:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:57:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:57:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:57:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 20:57:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 20:57:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 20:57:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 20:57:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:05,704 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 20:57:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:57:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313111538] [2023-11-22 20:57:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313111538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:57:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:57:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:57:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506193135] [2023-11-22 20:57:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:57:05,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:57:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:57:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:57:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:57:05,707 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 20:57:07,734 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 20:57:09,767 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 20:57:11,774 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 20:57:13,777 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 20:57:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:57:17,182 INFO L93 Difference]: Finished difference Result 2558 states and 3685 transitions. [2023-11-22 20:57:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:57:17,182 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 20:57:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:57:17,189 INFO L225 Difference]: With dead ends: 2558 [2023-11-22 20:57:17,190 INFO L226 Difference]: Without dead ends: 2556 [2023-11-22 20:57:17,190 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 20:57:17,192 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 2545 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 1386 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:57:17,192 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.2s Time] [2023-11-22 20:57:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2023-11-22 20:57:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2556. [2023-11-22 20:57:17,373 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 20:57:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3683 transitions. [2023-11-22 20:57:17,379 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3683 transitions. Word has length 114 [2023-11-22 20:57:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:57:17,380 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3683 transitions. [2023-11-22 20:57:17,380 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 20:57:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3683 transitions. [2023-11-22 20:57:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-22 20:57:17,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:57:17,382 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 20:57:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 20:57:17,382 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 20:57:17,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:57:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2132539334, now seen corresponding path program 1 times [2023-11-22 20:57:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:57:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712445498] [2023-11-22 20:57:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:57:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 20:57:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:57:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 20:57:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 20:57:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 20:57:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-22 20:57:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 20:57:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:57:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 20:57:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-22 20:57:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 20:57:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 20:57:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 20:57:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:57:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 20:57:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 20:57:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 20:57:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 20:57:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 20:57:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 20:57:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 20:57:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:18,253 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 20:57:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:57:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712445498] [2023-11-22 20:57:18,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712445498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:57:18,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:57:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:57:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976076647] [2023-11-22 20:57:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:57:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:57:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:57:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:57:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:57:18,256 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 20:57:20,283 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 20:57:22,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 20:57:24,339 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 20:57:26,381 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 [] Killed by 15