./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/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.graphml --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 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:36:38,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:36:38,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:36:38,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:36:38,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:36:38,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:36:38,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:36:38,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:36:38,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:36:38,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:36:38,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:36:38,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:36:38,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:36:38,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:36:38,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:36:38,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:36:38,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:36:38,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:36:38,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:36:38,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:36:38,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:36:38,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:36:38,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:36:38,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:36:38,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:36:38,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:36:38,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:36:38,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:36:38,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:36:38,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:36:38,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:36:38,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:36:38,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:36:38,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:36:38,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:36:38,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:36:38,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:36:38,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:36:38,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:36:38,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:36:38,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:36:38,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:36:38,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:36:38,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:36:38,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:36:38,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:36:38,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:36:38,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:36:38,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:36:38,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:36:38,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:36:38,305 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:36:38,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:36:38,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:36:38,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:36:38,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:36:38,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:36:38,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:36:38,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:36:38,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:36:38,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:36:38,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:36:38,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:36:38,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:36:38,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:36:38,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 [2022-07-14 04:36:38,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:36:38,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:36:38,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:36:38,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:36:38,532 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:36:38,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-14 04:36:38,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd951060/50a5636213184a068c4978e378f8995c/FLAGa9f9e2d7e [2022-07-14 04:36:39,257 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:36:39,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-14 04:36:39,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd951060/50a5636213184a068c4978e378f8995c/FLAGa9f9e2d7e [2022-07-14 04:36:39,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd951060/50a5636213184a068c4978e378f8995c [2022-07-14 04:36:39,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:36:39,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:36:39,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:36:39,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:36:39,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:36:39,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:36:39" (1/1) ... [2022-07-14 04:36:39,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd51ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:39, skipping insertion in model container [2022-07-14 04:36:39,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:36:39" (1/1) ... [2022-07-14 04:36:39,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:36:39,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:36:42,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-14 04:36:42,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-14 04:36:42,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-14 04:36:42,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-14 04:36:42,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-14 04:36:42,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-14 04:36:42,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-14 04:36:42,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-14 04:36:42,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-14 04:36:42,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-14 04:36:42,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-14 04:36:42,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-14 04:36:42,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-14 04:36:42,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-14 04:36:42,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-14 04:36:42,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-14 04:36:42,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-14 04:36:42,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-14 04:36:42,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-14 04:36:42,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-14 04:36:42,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-14 04:36:42,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-14 04:36:42,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-14 04:36:42,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-14 04:36:42,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-14 04:36:42,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-14 04:36:42,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-14 04:36:42,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-14 04:36:42,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-14 04:36:42,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-14 04:36:42,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-14 04:36:42,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-14 04:36:42,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-14 04:36:42,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-14 04:36:42,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-14 04:36:42,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-14 04:36:42,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-14 04:36:42,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-14 04:36:42,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-14 04:36:42,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-14 04:36:42,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-14 04:36:42,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-14 04:36:42,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-14 04:36:42,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-14 04:36:42,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-14 04:36:42,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-14 04:36:42,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-14 04:36:42,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-14 04:36:42,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-14 04:36:42,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-14 04:36:42,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-14 04:36:42,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-14 04:36:42,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-14 04:36:42,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-14 04:36:42,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-14 04:36:42,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-14 04:36:42,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-14 04:36:42,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-14 04:36:42,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-14 04:36:42,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-14 04:36:42,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-14 04:36:42,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-14 04:36:42,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-14 04:36:42,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-14 04:36:42,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-14 04:36:42,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-14 04:36:42,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-14 04:36:42,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-14 04:36:42,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-14 04:36:42,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-14 04:36:42,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-14 04:36:42,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-14 04:36:42,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-14 04:36:42,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-14 04:36:42,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-14 04:36:42,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-14 04:36:42,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-14 04:36:42,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-14 04:36:42,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-14 04:36:42,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-14 04:36:42,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-14 04:36:42,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-14 04:36:42,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-14 04:36:42,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-14 04:36:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-14 04:36:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-14 04:36:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-14 04:36:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-14 04:36:42,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:36:42,597 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:36:42,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-14 04:36:42,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-14 04:36:42,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-14 04:36:42,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-14 04:36:42,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-14 04:36:42,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-14 04:36:42,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-14 04:36:42,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-14 04:36:42,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-14 04:36:42,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-14 04:36:42,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-14 04:36:42,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-14 04:36:42,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-14 04:36:42,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-14 04:36:42,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-14 04:36:42,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-14 04:36:42,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-14 04:36:42,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-14 04:36:42,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-14 04:36:42,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-14 04:36:42,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-14 04:36:42,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-14 04:36:42,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-14 04:36:42,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-14 04:36:42,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-14 04:36:42,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-14 04:36:42,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-14 04:36:42,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-14 04:36:42,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-14 04:36:42,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-14 04:36:42,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-14 04:36:42,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-14 04:36:42,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-14 04:36:42,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-14 04:36:42,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-14 04:36:42,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-14 04:36:42,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-14 04:36:42,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-14 04:36:42,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-14 04:36:42,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-14 04:36:42,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-14 04:36:42,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-14 04:36:42,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-14 04:36:42,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-14 04:36:42,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-14 04:36:42,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-14 04:36:42,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-14 04:36:42,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-14 04:36:42,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-14 04:36:42,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-14 04:36:42,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-14 04:36:42,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-14 04:36:42,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-14 04:36:42,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-14 04:36:42,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-14 04:36:42,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-14 04:36:42,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-14 04:36:42,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-14 04:36:42,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-14 04:36:42,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-14 04:36:42,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-14 04:36:42,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-14 04:36:42,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-14 04:36:42,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-14 04:36:42,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-14 04:36:42,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-14 04:36:42,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-14 04:36:42,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-14 04:36:42,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-14 04:36:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-14 04:36:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-14 04:36:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-14 04:36:42,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-14 04:36:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-14 04:36:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-14 04:36:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-14 04:36:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-14 04:36:42,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-14 04:36:42,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-14 04:36:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-14 04:36:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-14 04:36:42,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-14 04:36:42,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-14 04:36:42,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-14 04:36:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-14 04:36:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-14 04:36:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-14 04:36:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-14 04:36:42,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:36:43,091 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:36:43,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43 WrapperNode [2022-07-14 04:36:43,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:36:43,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:36:43,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:36:43,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:36:43,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,294 INFO L137 Inliner]: procedures = 591, calls = 1808, calls flagged for inlining = 314, calls inlined = 232, statements flattened = 4571 [2022-07-14 04:36:43,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:36:43,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:36:43,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:36:43,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:36:43,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:36:43,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:36:43,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:36:43,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:36:43,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (1/1) ... [2022-07-14 04:36:43,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:36:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:36:43,589 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) [2022-07-14 04:36:43,607 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 [2022-07-14 04:36:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:36:43,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:36:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:36:43,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:36:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:36:43,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:36:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:36:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:36:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:36:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:36:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_unregister [2022-07-14 04:36:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_unregister [2022-07-14 04:36:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:36:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:36:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:36:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:36:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_get_drvdata [2022-07-14 04:36:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_get_drvdata [2022-07-14 04:36:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:36:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:36:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:36:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_poll [2022-07-14 04:36:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_poll [2022-07-14 04:36:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_put_noidle [2022-07-14 04:36:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_put_noidle [2022-07-14 04:36:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:36:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 04:36:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:36:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:36:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:36:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:36:43,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:36:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-14 04:36:43,629 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-14 04:36:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:36:43,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:36:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-14 04:36:43,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-14 04:36:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_resume [2022-07-14 04:36:43,629 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_resume [2022-07-14 04:36:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure iio_priv [2022-07-14 04:36:43,630 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_priv [2022-07-14 04:36:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:36:43,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:36:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:36:43,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:36:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:36:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_acc_reg [2022-07-14 04:36:43,630 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_acc_reg [2022-07-14 04:36:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_mode [2022-07-14 04:36:43,631 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_mode [2022-07-14 04:36:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:36:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:36:43,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:36:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:36:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:36:43,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:36:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:36:43,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:36:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure iio_push_event [2022-07-14 04:36:43,632 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_push_event [2022-07-14 04:36:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:36:43,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:36:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-14 04:36:43,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-14 04:36:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-14 04:36:43,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-14 04:36:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:36:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:36:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2022-07-14 04:36:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_trig_try_reen [2022-07-14 04:36:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_trig_try_reen [2022-07-14 04:36:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:36:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:36:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_remove [2022-07-14 04:36:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_remove [2022-07-14 04:36:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-14 04:36:43,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-14 04:36:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_range [2022-07-14 04:36:43,638 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_range [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:36:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:36:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_register [2022-07-14 04:36:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_register [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:36:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:36:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-14 04:36:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-14 04:36:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_read_byte_data [2022-07-14 04:36:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_read_byte_data [2022-07-14 04:36:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:36:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure iio_triggered_buffer_cleanup [2022-07-14 04:36:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_triggered_buffer_cleanup [2022-07-14 04:36:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_suspend [2022-07-14 04:36:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_suspend [2022-07-14 04:36:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-14 04:36:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:36:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_power_state [2022-07-14 04:36:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_power_state [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:36:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_set_drvdata [2022-07-14 04:36:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_set_drvdata [2022-07-14 04:36:43,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_register [2022-07-14 04:36:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_register [2022-07-14 04:36:43,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:36:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:36:43,642 INFO L130 BoogieDeclarations]: Found specification of procedure __pm_runtime_set_status [2022-07-14 04:36:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __pm_runtime_set_status [2022-07-14 04:36:43,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:36:43,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:36:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:36:43,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:36:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_unregister [2022-07-14 04:36:43,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_unregister [2022-07-14 04:36:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:36:43,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:36:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure iio_device_unregister [2022-07-14 04:36:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_device_unregister [2022-07-14 04:36:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:36:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:36:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-14 04:36:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-14 04:36:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_triggered_buffer_cleanup [2022-07-14 04:36:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_triggered_buffer_cleanup [2022-07-14 04:36:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:36:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:36:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:36:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:36:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_mode [2022-07-14 04:36:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_mode [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_resume [2022-07-14 04:36:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_resume [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:36:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:36:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:36:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:36:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_suspend [2022-07-14 04:36:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_suspend [2022-07-14 04:36:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:36:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_write_byte_data [2022-07-14 04:36:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_write_byte_data [2022-07-14 04:36:44,292 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:36:44,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:36:44,439 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:36:58,160 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:36:58,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:36:58,173 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 04:36:58,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:36:58 BoogieIcfgContainer [2022-07-14 04:36:58,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:36:58,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:36:58,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:36:58,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:36:58,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:36:39" (1/3) ... [2022-07-14 04:36:58,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750f8d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:36:58, skipping insertion in model container [2022-07-14 04:36:58,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:43" (2/3) ... [2022-07-14 04:36:58,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750f8d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:36:58, skipping insertion in model container [2022-07-14 04:36:58,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:36:58" (3/3) ... [2022-07-14 04:36:58,185 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-14 04:36:58,196 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:36:58,197 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-07-14 04:36:58,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:36:58,288 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c558000, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56c72cdb [2022-07-14 04:36:58,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-07-14 04:36:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2022-07-14 04:36:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:36:58,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:58,309 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-14 04:36:58,310 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)] === [2022-07-14 04:36:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -727309348, now seen corresponding path program 1 times [2022-07-14 04:36:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:58,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793069216] [2022-07-14 04:36:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:36:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793069216] [2022-07-14 04:36:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793069216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:59,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615919386] [2022-07-14 04:36:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:59,229 INFO L87 Difference]: Start difference. First operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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) [2022-07-14 04:37:01,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:03,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:07,262 INFO L93 Difference]: Finished difference Result 2884 states and 4163 transitions. [2022-07-14 04:37:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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 64 [2022-07-14 04:37:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:07,285 INFO L225 Difference]: With dead ends: 2884 [2022-07-14 04:37:07,285 INFO L226 Difference]: Without dead ends: 1436 [2022-07-14 04:37:07,301 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 [2022-07-14 04:37:07,304 INFO L413 NwaCegarLoop]: 1815 mSDtfsCounter, 2973 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 1235 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3160 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1235 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:07,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3160 Valid, 3587 Invalid, 3002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1235 Valid, 1765 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-07-14 04:37:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-07-14 04:37:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2022-07-14 04:37:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1008 states have (on average 1.2599206349206349) internal successors, (1270), 1048 states have internal predecessors, (1270), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1936 transitions. [2022-07-14 04:37:07,419 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1936 transitions. Word has length 64 [2022-07-14 04:37:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:07,436 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1936 transitions. [2022-07-14 04:37:07,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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) [2022-07-14 04:37:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1936 transitions. [2022-07-14 04:37:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:37:07,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:07,439 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-14 04:37:07,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:37:07,440 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)] === [2022-07-14 04:37:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1915016473, now seen corresponding path program 1 times [2022-07-14 04:37:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:07,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095609492] [2022-07-14 04:37:07,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:07,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095609492] [2022-07-14 04:37:07,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095609492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:07,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:07,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707486196] [2022-07-14 04:37:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:07,823 INFO L87 Difference]: Start difference. First operand 1436 states and 1936 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2022-07-14 04:37:09,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:11,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:15,264 INFO L93 Difference]: Finished difference Result 1436 states and 1936 transitions. [2022-07-14 04:37:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2022-07-14 04:37:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:15,275 INFO L225 Difference]: With dead ends: 1436 [2022-07-14 04:37:15,275 INFO L226 Difference]: Without dead ends: 1434 [2022-07-14 04:37:15,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:37:15,280 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 2936 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3120 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:15,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3120 Valid, 3545 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1749 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-14 04:37:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-07-14 04:37:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2022-07-14 04:37:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1007 states have (on average 1.259185700099305) internal successors, (1268), 1046 states have internal predecessors, (1268), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1934 transitions. [2022-07-14 04:37:15,364 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1934 transitions. Word has length 70 [2022-07-14 04:37:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:15,367 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1934 transitions. [2022-07-14 04:37:15,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2022-07-14 04:37:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1934 transitions. [2022-07-14 04:37:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:37:15,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:15,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-14 04:37:15,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:37:15,376 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)] === [2022-07-14 04:37:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 154427305, now seen corresponding path program 1 times [2022-07-14 04:37:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157132312] [2022-07-14 04:37:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:15,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157132312] [2022-07-14 04:37:15,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157132312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:15,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:15,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275939687] [2022-07-14 04:37:15,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:15,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:15,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:15,786 INFO L87 Difference]: Start difference. First operand 1434 states and 1934 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, (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) [2022-07-14 04:37:17,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:19,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:23,005 INFO L93 Difference]: Finished difference Result 1434 states and 1934 transitions. [2022-07-14 04:37:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:23,006 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, (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 76 [2022-07-14 04:37:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:23,013 INFO L225 Difference]: With dead ends: 1434 [2022-07-14 04:37:23,013 INFO L226 Difference]: Without dead ends: 1432 [2022-07-14 04:37:23,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:37:23,015 INFO L413 NwaCegarLoop]: 1791 mSDtfsCounter, 2930 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:23,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3543 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1747 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:37:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-14 04:37:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2022-07-14 04:37:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1006 states have (on average 1.2584493041749503) internal successors, (1266), 1044 states have internal predecessors, (1266), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1932 transitions. [2022-07-14 04:37:23,061 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1932 transitions. Word has length 76 [2022-07-14 04:37:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:23,061 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1932 transitions. [2022-07-14 04:37:23,061 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, (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) [2022-07-14 04:37:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1932 transitions. [2022-07-14 04:37:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:37:23,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:23,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-14 04:37:23,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:37:23,063 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)] === [2022-07-14 04:37:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 400513827, now seen corresponding path program 1 times [2022-07-14 04:37:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655672495] [2022-07-14 04:37:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:23,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655672495] [2022-07-14 04:37:23,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655672495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:23,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:23,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883280013] [2022-07-14 04:37:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:23,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:23,339 INFO L87 Difference]: Start difference. First operand 1432 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-14 04:37:25,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:27,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:30,455 INFO L93 Difference]: Finished difference Result 1432 states and 1932 transitions. [2022-07-14 04:37:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2022-07-14 04:37:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:30,464 INFO L225 Difference]: With dead ends: 1432 [2022-07-14 04:37:30,464 INFO L226 Difference]: Without dead ends: 1430 [2022-07-14 04:37:30,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:37:30,467 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 2924 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:30,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 3541 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1745 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:37:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-07-14 04:37:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2022-07-14 04:37:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1005 states have (on average 1.2577114427860696) internal successors, (1264), 1042 states have internal predecessors, (1264), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1930 transitions. [2022-07-14 04:37:30,531 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1930 transitions. Word has length 82 [2022-07-14 04:37:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:30,532 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1930 transitions. [2022-07-14 04:37:30,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-14 04:37:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1930 transitions. [2022-07-14 04:37:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:37:30,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:30,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-14 04:37:30,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:37:30,536 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)] === [2022-07-14 04:37:30,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1771881735, now seen corresponding path program 1 times [2022-07-14 04:37:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:30,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752689831] [2022-07-14 04:37:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:37:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:30,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752689831] [2022-07-14 04:37:30,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752689831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:30,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:30,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95782491] [2022-07-14 04:37:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:30,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:30,882 INFO L87 Difference]: Start difference. First operand 1430 states and 1930 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, (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) [2022-07-14 04:37:32,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:34,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:37,907 INFO L93 Difference]: Finished difference Result 1430 states and 1930 transitions. [2022-07-14 04:37:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:37,907 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, (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 88 [2022-07-14 04:37:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:37,913 INFO L225 Difference]: With dead ends: 1430 [2022-07-14 04:37:37,913 INFO L226 Difference]: Without dead ends: 1428 [2022-07-14 04:37:37,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:37:37,915 INFO L413 NwaCegarLoop]: 1787 mSDtfsCounter, 2918 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:37,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3539 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1743 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-14 04:37:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2022-07-14 04:37:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2022-07-14 04:37:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1004 states have (on average 1.2569721115537849) internal successors, (1262), 1040 states have internal predecessors, (1262), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1928 transitions. [2022-07-14 04:37:37,957 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1928 transitions. Word has length 88 [2022-07-14 04:37:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:37,958 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 1928 transitions. [2022-07-14 04:37:37,958 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, (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) [2022-07-14 04:37:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1928 transitions. [2022-07-14 04:37:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:37:37,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:37,959 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:37:37,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:37:37,959 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)] === [2022-07-14 04:37:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash 408227580, now seen corresponding path program 1 times [2022-07-14 04:37:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:37,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675967840] [2022-07-14 04:37:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:37:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:37:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:38,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675967840] [2022-07-14 04:37:38,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675967840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:38,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:38,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311974001] [2022-07-14 04:37:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:38,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:38,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:38,243 INFO L87 Difference]: Start difference. First operand 1428 states and 1928 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-07-14 04:37:40,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:42,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:45,429 INFO L93 Difference]: Finished difference Result 1428 states and 1928 transitions. [2022-07-14 04:37:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:45,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2022-07-14 04:37:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:45,438 INFO L225 Difference]: With dead ends: 1428 [2022-07-14 04:37:45,438 INFO L226 Difference]: Without dead ends: 1426 [2022-07-14 04:37:45,440 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 [2022-07-14 04:37:45,441 INFO L413 NwaCegarLoop]: 1785 mSDtfsCounter, 2912 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:45,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3092 Valid, 3537 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1741 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:37:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-07-14 04:37:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-07-14 04:37:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1003 states have (on average 1.2562313060817547) internal successors, (1260), 1038 states have internal predecessors, (1260), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1926 transitions. [2022-07-14 04:37:45,504 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1926 transitions. Word has length 94 [2022-07-14 04:37:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:45,505 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 1926 transitions. [2022-07-14 04:37:45,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-07-14 04:37:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1926 transitions. [2022-07-14 04:37:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:37:45,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:45,507 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:37:45,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:37:45,507 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)] === [2022-07-14 04:37:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1237999984, now seen corresponding path program 1 times [2022-07-14 04:37:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:45,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74078511] [2022-07-14 04:37:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:37:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:37:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:37:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74078511] [2022-07-14 04:37:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74078511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:45,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:45,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548312165] [2022-07-14 04:37:45,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:45,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:45,880 INFO L87 Difference]: Start difference. First operand 1426 states and 1926 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-14 04:37:47,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:49,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:52,984 INFO L93 Difference]: Finished difference Result 1426 states and 1926 transitions. [2022-07-14 04:37:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 100 [2022-07-14 04:37:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:52,991 INFO L225 Difference]: With dead ends: 1426 [2022-07-14 04:37:52,991 INFO L226 Difference]: Without dead ends: 1424 [2022-07-14 04:37:52,992 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 [2022-07-14 04:37:52,993 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 2906 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3085 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:52,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3085 Valid, 3535 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1739 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:37:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-07-14 04:37:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2022-07-14 04:37:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1002 states have (on average 1.255489021956088) internal successors, (1258), 1036 states have internal predecessors, (1258), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:37:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1924 transitions. [2022-07-14 04:37:53,073 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1924 transitions. Word has length 100 [2022-07-14 04:37:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 1924 transitions. [2022-07-14 04:37:53,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-14 04:37:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1924 transitions. [2022-07-14 04:37:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:37:53,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:53,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:37:53,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:37:53,077 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)] === [2022-07-14 04:37:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1395575479, now seen corresponding path program 1 times [2022-07-14 04:37:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129333033] [2022-07-14 04:37:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:53,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:37:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:37:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:37:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:37:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:37:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:53,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129333033] [2022-07-14 04:37:53,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129333033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:53,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:53,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153755657] [2022-07-14 04:37:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:53,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:53,367 INFO L87 Difference]: Start difference. First operand 1424 states and 1924 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, (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) [2022-07-14 04:37:55,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:57,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:00,087 INFO L93 Difference]: Finished difference Result 1424 states and 1924 transitions. [2022-07-14 04:38:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:00,088 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, (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 106 [2022-07-14 04:38:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:00,094 INFO L225 Difference]: With dead ends: 1424 [2022-07-14 04:38:00,094 INFO L226 Difference]: Without dead ends: 1422 [2022-07-14 04:38:00,095 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 [2022-07-14 04:38:00,095 INFO L413 NwaCegarLoop]: 1781 mSDtfsCounter, 2904 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3082 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:00,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3082 Valid, 3533 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1733 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:38:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-07-14 04:38:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2022-07-14 04:38:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1001 states have (on average 1.2547452547452547) internal successors, (1256), 1034 states have internal predecessors, (1256), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:38:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1922 transitions. [2022-07-14 04:38:00,145 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1922 transitions. Word has length 106 [2022-07-14 04:38:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:00,145 INFO L495 AbstractCegarLoop]: Abstraction has 1422 states and 1922 transitions. [2022-07-14 04:38:00,145 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, (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) [2022-07-14 04:38:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1922 transitions. [2022-07-14 04:38:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:38:00,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:00,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:00,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:38:00,147 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)] === [2022-07-14 04:38:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1118375354, now seen corresponding path program 1 times [2022-07-14 04:38:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077673206] [2022-07-14 04:38:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:38:00,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077673206] [2022-07-14 04:38:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077673206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:00,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:00,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446717889] [2022-07-14 04:38:00,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:00,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:00,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:00,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:00,528 INFO L87 Difference]: Start difference. First operand 1422 states and 1922 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-14 04:38:02,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:04,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:07,176 INFO L93 Difference]: Finished difference Result 1422 states and 1922 transitions. [2022-07-14 04:38:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-14 04:38:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:07,184 INFO L225 Difference]: With dead ends: 1422 [2022-07-14 04:38:07,184 INFO L226 Difference]: Without dead ends: 1420 [2022-07-14 04:38:07,185 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 [2022-07-14 04:38:07,186 INFO L413 NwaCegarLoop]: 1779 mSDtfsCounter, 2892 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3070 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:07,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3070 Valid, 3531 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1735 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-14 04:38:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-14 04:38:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2022-07-14 04:38:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1000 states have (on average 1.254) internal successors, (1254), 1032 states have internal predecessors, (1254), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:38:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1920 transitions. [2022-07-14 04:38:07,253 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1920 transitions. Word has length 108 [2022-07-14 04:38:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:07,253 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 1920 transitions. [2022-07-14 04:38:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-14 04:38:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1920 transitions. [2022-07-14 04:38:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-14 04:38:07,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:07,256 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 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] [2022-07-14 04:38:07,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:38:07,257 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)] === [2022-07-14 04:38:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1557431567, now seen corresponding path program 1 times [2022-07-14 04:38:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706871441] [2022-07-14 04:38:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:38:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:38:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:38:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:38:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:38:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 04:38:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706871441] [2022-07-14 04:38:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706871441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:07,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:07,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576615699] [2022-07-14 04:38:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:07,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:07,640 INFO L87 Difference]: Start difference. First operand 1420 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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) [2022-07-14 04:38:09,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:11,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:13,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:16,442 INFO L93 Difference]: Finished difference Result 2026 states and 2650 transitions. [2022-07-14 04:38:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:38:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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 129 [2022-07-14 04:38:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:16,451 INFO L225 Difference]: With dead ends: 2026 [2022-07-14 04:38:16,451 INFO L226 Difference]: Without dead ends: 1420 [2022-07-14 04:38:16,454 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 [2022-07-14 04:38:16,455 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 3266 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 1625 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3461 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:16,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3461 Valid, 3092 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 1393 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2022-07-14 04:38:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-14 04:38:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1416. [2022-07-14 04:38:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 997 states have (on average 1.2527582748244734) internal successors, (1249), 1028 states have internal predecessors, (1249), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-14 04:38:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1915 transitions. [2022-07-14 04:38:16,525 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1915 transitions. Word has length 129 [2022-07-14 04:38:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:16,525 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1915 transitions. [2022-07-14 04:38:16,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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) [2022-07-14 04:38:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1915 transitions. [2022-07-14 04:38:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:38:16,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:16,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:16,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:38:16,528 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)] === [2022-07-14 04:38:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 382673920, now seen corresponding path program 1 times [2022-07-14 04:38:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:16,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579704843] [2022-07-14 04:38:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:16,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:38:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:38:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:16,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579704843] [2022-07-14 04:38:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579704843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:16,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:16,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048993654] [2022-07-14 04:38:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:16,848 INFO L87 Difference]: Start difference. First operand 1416 states and 1915 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (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) [2022-07-14 04:38:18,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:20,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:28,379 INFO L93 Difference]: Finished difference Result 2811 states and 3799 transitions. [2022-07-14 04:38:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:38:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2022-07-14 04:38:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:28,395 INFO L225 Difference]: With dead ends: 2811 [2022-07-14 04:38:28,395 INFO L226 Difference]: Without dead ends: 2809 [2022-07-14 04:38:28,397 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 [2022-07-14 04:38:28,397 INFO L413 NwaCegarLoop]: 2522 mSDtfsCounter, 3566 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 4240 mSolverCounterSat, 1939 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 6181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 4240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:28,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 5171 Invalid, 6181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 4240 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2022-07-14 04:38:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-07-14 04:38:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2705. [2022-07-14 04:38:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 1923 states have (on average 1.2553302132085284) internal successors, (2414), 1970 states have internal predecessors, (2414), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-14 04:38:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3688 transitions. [2022-07-14 04:38:28,531 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3688 transitions. Word has length 114 [2022-07-14 04:38:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:28,533 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3688 transitions. [2022-07-14 04:38:28,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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) [2022-07-14 04:38:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3688 transitions. [2022-07-14 04:38:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-14 04:38:28,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:28,537 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 2, 2, 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] [2022-07-14 04:38:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:38:28,537 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)] === [2022-07-14 04:38:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 13417120, now seen corresponding path program 1 times [2022-07-14 04:38:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489811631] [2022-07-14 04:38:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:38:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:38:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:38:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:38:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:38:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 04:38:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-14 04:38:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489811631] [2022-07-14 04:38:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489811631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:38:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253469520] [2022-07-14 04:38:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:38:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:28,912 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) [2022-07-14 04:38:28,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 04:38:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:38:29,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:38:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 04:38:29,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:38:29,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253469520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:29,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:38:29,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:38:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933828607] [2022-07-14 04:38:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:29,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:38:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:38:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:29,852 INFO L87 Difference]: Start difference. First operand 2705 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-07-14 04:38:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:30,021 INFO L93 Difference]: Finished difference Result 3810 states and 5034 transitions. [2022-07-14 04:38:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:38:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 135 [2022-07-14 04:38:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:30,037 INFO L225 Difference]: With dead ends: 3810 [2022-07-14 04:38:30,037 INFO L226 Difference]: Without dead ends: 2699 [2022-07-14 04:38:30,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:30,043 INFO L413 NwaCegarLoop]: 1909 mSDtfsCounter, 1895 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:30,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1909 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:38:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-07-14 04:38:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699. [2022-07-14 04:38:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1918 states have (on average 1.253910323253389) internal successors, (2405), 1964 states have internal predecessors, (2405), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-14 04:38:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3679 transitions. [2022-07-14 04:38:30,198 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3679 transitions. Word has length 135 [2022-07-14 04:38:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:30,199 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3679 transitions. [2022-07-14 04:38:30,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-07-14 04:38:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3679 transitions. [2022-07-14 04:38:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:38:30,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:30,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:30,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 04:38:30,411 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 [2022-07-14 04:38:30,411 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)] === [2022-07-14 04:38:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1128396839, now seen corresponding path program 1 times [2022-07-14 04:38:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:30,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363621680] [2022-07-14 04:38:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:38:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:38:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:38:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:30,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363621680] [2022-07-14 04:38:30,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363621680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:30,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:30,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655618110] [2022-07-14 04:38:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:30,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:30,769 INFO L87 Difference]: Start difference. First operand 2699 states and 3679 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-14 04:38:32,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:34,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:38,376 INFO L93 Difference]: Finished difference Result 2699 states and 3679 transitions. [2022-07-14 04:38:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-14 04:38:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:38,390 INFO L225 Difference]: With dead ends: 2699 [2022-07-14 04:38:38,390 INFO L226 Difference]: Without dead ends: 2697 [2022-07-14 04:38:38,393 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 [2022-07-14 04:38:38,396 INFO L413 NwaCegarLoop]: 1767 mSDtfsCounter, 2878 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:38,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3491 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1731 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-14 04:38:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2022-07-14 04:38:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2697. [2022-07-14 04:38:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1917 states have (on average 1.2535211267605635) internal successors, (2403), 1962 states have internal predecessors, (2403), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-14 04:38:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3677 transitions. [2022-07-14 04:38:38,542 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3677 transitions. Word has length 120 [2022-07-14 04:38:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:38,542 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3677 transitions. [2022-07-14 04:38:38,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-14 04:38:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3677 transitions. [2022-07-14 04:38:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:38:38,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:38,546 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:38,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:38:38,546 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)] === [2022-07-14 04:38:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1109898579, now seen corresponding path program 1 times [2022-07-14 04:38:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:38,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030354269] [2022-07-14 04:38:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:38:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:38:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:38:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:38:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030354269] [2022-07-14 04:38:38,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030354269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:38,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611289991] [2022-07-14 04:38:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:38,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:38,900 INFO L87 Difference]: Start difference. First operand 2697 states and 3677 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-14 04:38:40,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:42,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:46,249 INFO L93 Difference]: Finished difference Result 2697 states and 3677 transitions. [2022-07-14 04:38:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-07-14 04:38:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:46,260 INFO L225 Difference]: With dead ends: 2697 [2022-07-14 04:38:46,260 INFO L226 Difference]: Without dead ends: 2695 [2022-07-14 04:38:46,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:46,262 INFO L413 NwaCegarLoop]: 1765 mSDtfsCounter, 2872 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:46,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3489 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1729 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:38:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-07-14 04:38:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2695. [2022-07-14 04:38:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 1916 states have (on average 1.2531315240083507) internal successors, (2401), 1960 states have internal predecessors, (2401), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-14 04:38:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3675 transitions. [2022-07-14 04:38:46,425 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3675 transitions. Word has length 126 [2022-07-14 04:38:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:46,425 INFO L495 AbstractCegarLoop]: Abstraction has 2695 states and 3675 transitions. [2022-07-14 04:38:46,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-14 04:38:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3675 transitions. [2022-07-14 04:38:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-14 04:38:46,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:46,429 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:46,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:38:46,429 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)] === [2022-07-14 04:38:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 138561349, now seen corresponding path program 1 times [2022-07-14 04:38:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981545351] [2022-07-14 04:38:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:38:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:38:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:38:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:38:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:38:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:38:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:38:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:38:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-14 04:38:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:46,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981545351] [2022-07-14 04:38:46,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981545351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:46,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:46,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:38:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042772438] [2022-07-14 04:38:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:46,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:38:46,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:38:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:38:46,939 INFO L87 Difference]: Start difference. First operand 2695 states and 3675 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-07-14 04:38:48,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:51,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:53,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:57,927 INFO L93 Difference]: Finished difference Result 2851 states and 3873 transitions. [2022-07-14 04:38:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:38:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 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 154 [2022-07-14 04:38:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:57,948 INFO L225 Difference]: With dead ends: 2851 [2022-07-14 04:38:57,948 INFO L226 Difference]: Without dead ends: 2849 [2022-07-14 04:38:57,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:38:57,951 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 3149 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 1574 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3297 SdHoareTripleChecker+Valid, 4701 SdHoareTripleChecker+Invalid, 5662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:57,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3297 Valid, 4701 Invalid, 5662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 4085 Invalid, 3 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 04:38:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2022-07-14 04:38:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2841. [2022-07-14 04:38:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2037 states have (on average 1.2547864506627393) internal successors, (2556), 2080 states have internal predecessors, (2556), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:38:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3854 transitions. [2022-07-14 04:38:58,107 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3854 transitions. Word has length 154 [2022-07-14 04:38:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:58,108 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 3854 transitions. [2022-07-14 04:38:58,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-07-14 04:38:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3854 transitions. [2022-07-14 04:38:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:38:58,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:58,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:38:58,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:38:58,112 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)] === [2022-07-14 04:38:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2002495305, now seen corresponding path program 1 times [2022-07-14 04:38:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:58,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51849410] [2022-07-14 04:38:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:38:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:38:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:38:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:38:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:38:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51849410] [2022-07-14 04:38:58,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51849410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:58,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:58,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361821146] [2022-07-14 04:38:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:58,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:58,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:58,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:58,434 INFO L87 Difference]: Start difference. First operand 2841 states and 3854 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-14 04:39:00,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:02,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:05,381 INFO L93 Difference]: Finished difference Result 2841 states and 3854 transitions. [2022-07-14 04:39:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2022-07-14 04:39:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:05,393 INFO L225 Difference]: With dead ends: 2841 [2022-07-14 04:39:05,393 INFO L226 Difference]: Without dead ends: 2839 [2022-07-14 04:39:05,395 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 [2022-07-14 04:39:05,395 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 2860 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:05,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3485 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1725 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 04:39:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2022-07-14 04:39:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2022-07-14 04:39:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2036 states have (on average 1.2544204322200392) internal successors, (2554), 2078 states have internal predecessors, (2554), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3852 transitions. [2022-07-14 04:39:05,548 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3852 transitions. Word has length 132 [2022-07-14 04:39:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:05,549 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3852 transitions. [2022-07-14 04:39:05,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-14 04:39:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3852 transitions. [2022-07-14 04:39:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:39:05,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:05,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:05,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:39:05,553 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)] === [2022-07-14 04:39:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash 269312601, now seen corresponding path program 1 times [2022-07-14 04:39:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:05,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992024192] [2022-07-14 04:39:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:39:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:39:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:05,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992024192] [2022-07-14 04:39:05,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992024192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:05,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:05,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679094504] [2022-07-14 04:39:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:05,861 INFO L87 Difference]: Start difference. First operand 2839 states and 3852 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-14 04:39:07,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:09,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:12,856 INFO L93 Difference]: Finished difference Result 2839 states and 3852 transitions. [2022-07-14 04:39:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:12,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2022-07-14 04:39:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:12,866 INFO L225 Difference]: With dead ends: 2839 [2022-07-14 04:39:12,866 INFO L226 Difference]: Without dead ends: 2837 [2022-07-14 04:39:12,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:12,867 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 2854 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3027 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:12,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3027 Valid, 3483 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1723 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-14 04:39:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2022-07-14 04:39:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2837. [2022-07-14 04:39:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2035 states have (on average 1.2540540540540541) internal successors, (2552), 2076 states have internal predecessors, (2552), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 3850 transitions. [2022-07-14 04:39:12,979 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 3850 transitions. Word has length 138 [2022-07-14 04:39:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:12,979 INFO L495 AbstractCegarLoop]: Abstraction has 2837 states and 3850 transitions. [2022-07-14 04:39:12,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-14 04:39:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3850 transitions. [2022-07-14 04:39:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:39:12,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:12,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:12,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:39:12,983 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)] === [2022-07-14 04:39:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1054392417, now seen corresponding path program 1 times [2022-07-14 04:39:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:12,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502563138] [2022-07-14 04:39:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:39:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:39:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:39:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:13,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502563138] [2022-07-14 04:39:13,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502563138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:13,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:13,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887456936] [2022-07-14 04:39:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:13,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:13,316 INFO L87 Difference]: Start difference. First operand 2837 states and 3850 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-14 04:39:15,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:17,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:20,597 INFO L93 Difference]: Finished difference Result 2837 states and 3850 transitions. [2022-07-14 04:39:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2022-07-14 04:39:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:20,607 INFO L225 Difference]: With dead ends: 2837 [2022-07-14 04:39:20,607 INFO L226 Difference]: Without dead ends: 2835 [2022-07-14 04:39:20,610 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 [2022-07-14 04:39:20,610 INFO L413 NwaCegarLoop]: 1757 mSDtfsCounter, 2848 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:20,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 3481 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1721 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:39:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-14 04:39:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2022-07-14 04:39:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2034 states have (on average 1.2536873156342183) internal successors, (2550), 2074 states have internal predecessors, (2550), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3848 transitions. [2022-07-14 04:39:20,736 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3848 transitions. Word has length 144 [2022-07-14 04:39:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:20,736 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3848 transitions. [2022-07-14 04:39:20,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-14 04:39:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3848 transitions. [2022-07-14 04:39:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 04:39:20,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:20,740 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:20,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:39:20,740 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-14 04:39:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -603031875, now seen corresponding path program 1 times [2022-07-14 04:39:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57972323] [2022-07-14 04:39:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:39:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:39:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:39:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:39:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 04:39:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:39:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:39:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:39:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-14 04:39:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57972323] [2022-07-14 04:39:21,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57972323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:21,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:21,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:39:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993014790] [2022-07-14 04:39:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:39:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:39:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:21,218 INFO L87 Difference]: Start difference. First operand 2835 states and 3848 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:39:23,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:25,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:27,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:29,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:31,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:41,853 INFO L93 Difference]: Finished difference Result 3823 states and 5454 transitions. [2022-07-14 04:39:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 04:39:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 176 [2022-07-14 04:39:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:41,871 INFO L225 Difference]: With dead ends: 3823 [2022-07-14 04:39:41,871 INFO L226 Difference]: Without dead ends: 3821 [2022-07-14 04:39:41,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-07-14 04:39:41,875 INFO L413 NwaCegarLoop]: 1876 mSDtfsCounter, 4831 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 6735 mSolverCounterSat, 3322 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4838 SdHoareTripleChecker+Valid, 6488 SdHoareTripleChecker+Invalid, 10062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3322 IncrementalHoareTripleChecker+Valid, 6735 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:41,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4838 Valid, 6488 Invalid, 10062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3322 Valid, 6735 Invalid, 5 Unknown, 0 Unchecked, 19.7s Time] [2022-07-14 04:39:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-07-14 04:39:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2833. [2022-07-14 04:39:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2033 states have (on average 1.2528283325135268) internal successors, (2547), 2072 states have internal predecessors, (2547), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3845 transitions. [2022-07-14 04:39:42,028 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3845 transitions. Word has length 176 [2022-07-14 04:39:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:42,029 INFO L495 AbstractCegarLoop]: Abstraction has 2833 states and 3845 transitions. [2022-07-14 04:39:42,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:39:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3845 transitions. [2022-07-14 04:39:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-14 04:39:42,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:42,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:42,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:39:42,032 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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)] === [2022-07-14 04:39:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1136288553, now seen corresponding path program 1 times [2022-07-14 04:39:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:42,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567547445] [2022-07-14 04:39:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:39:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:39:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:39:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:39:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:42,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567547445] [2022-07-14 04:39:42,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567547445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:42,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:42,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019151213] [2022-07-14 04:39:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:42,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:42,332 INFO L87 Difference]: Start difference. First operand 2833 states and 3845 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-14 04:39:44,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:46,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:50,214 INFO L93 Difference]: Finished difference Result 2833 states and 3845 transitions. [2022-07-14 04:39:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-14 04:39:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:50,226 INFO L225 Difference]: With dead ends: 2833 [2022-07-14 04:39:50,227 INFO L226 Difference]: Without dead ends: 2831 [2022-07-14 04:39:50,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:50,230 INFO L413 NwaCegarLoop]: 1753 mSDtfsCounter, 2836 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3007 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:50,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3007 Valid, 3477 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1717 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-07-14 04:39:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-07-14 04:39:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2831. [2022-07-14 04:39:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2032 states have (on average 1.25246062992126) internal successors, (2545), 2070 states have internal predecessors, (2545), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3843 transitions. [2022-07-14 04:39:50,436 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3843 transitions. Word has length 150 [2022-07-14 04:39:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 2831 states and 3843 transitions. [2022-07-14 04:39:50,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-14 04:39:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3843 transitions. [2022-07-14 04:39:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 04:39:50,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:50,441 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:50,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:39:50,442 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_rtnetlink_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)] === [2022-07-14 04:39:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1255467933, now seen corresponding path program 1 times [2022-07-14 04:39:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:50,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814607610] [2022-07-14 04:39:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:39:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:39:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:39:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:39:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:39:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:50,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814607610] [2022-07-14 04:39:50,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814607610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:50,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:50,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977323565] [2022-07-14 04:39:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:50,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:50,831 INFO L87 Difference]: Start difference. First operand 2831 states and 3843 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:39:52,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:54,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:58,525 INFO L93 Difference]: Finished difference Result 2831 states and 3843 transitions. [2022-07-14 04:39:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-14 04:39:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:58,535 INFO L225 Difference]: With dead ends: 2831 [2022-07-14 04:39:58,535 INFO L226 Difference]: Without dead ends: 2829 [2022-07-14 04:39:58,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:58,540 INFO L413 NwaCegarLoop]: 1751 mSDtfsCounter, 2830 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:58,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 3475 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1715 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-14 04:39:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-07-14 04:39:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2022-07-14 04:39:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2031 states have (on average 1.2520925652387986) internal successors, (2543), 2068 states have internal predecessors, (2543), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:39:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 3841 transitions. [2022-07-14 04:39:58,769 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 3841 transitions. Word has length 156 [2022-07-14 04:39:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:58,769 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 3841 transitions. [2022-07-14 04:39:58,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:39:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 3841 transitions. [2022-07-14 04:39:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 04:39:58,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:58,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:58,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:39:58,775 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_sock_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)] === [2022-07-14 04:39:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash 511816783, now seen corresponding path program 1 times [2022-07-14 04:39:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:58,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746000718] [2022-07-14 04:39:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:39:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:39:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:39:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:39:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:39:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:39:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:59,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746000718] [2022-07-14 04:39:59,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746000718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:59,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:59,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821926476] [2022-07-14 04:39:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:59,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:59,161 INFO L87 Difference]: Start difference. First operand 2829 states and 3841 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:40:01,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:03,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:06,529 INFO L93 Difference]: Finished difference Result 2829 states and 3841 transitions. [2022-07-14 04:40:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-14 04:40:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:06,544 INFO L225 Difference]: With dead ends: 2829 [2022-07-14 04:40:06,544 INFO L226 Difference]: Without dead ends: 2827 [2022-07-14 04:40:06,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:06,546 INFO L413 NwaCegarLoop]: 1749 mSDtfsCounter, 2824 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 3473 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1713 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:40:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-07-14 04:40:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2022-07-14 04:40:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2030 states have (on average 1.2517241379310344) internal successors, (2541), 2066 states have internal predecessors, (2541), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:40:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3839 transitions. [2022-07-14 04:40:06,693 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3839 transitions. Word has length 162 [2022-07-14 04:40:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:06,693 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 3839 transitions. [2022-07-14 04:40:06,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:40:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3839 transitions. [2022-07-14 04:40:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 04:40:06,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:06,698 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:06,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:40:06,698 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_coherent_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)] === [2022-07-14 04:40:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 391898802, now seen corresponding path program 1 times [2022-07-14 04:40:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:06,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211954279] [2022-07-14 04:40:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:40:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:40:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:40:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:07,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211954279] [2022-07-14 04:40:07,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211954279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:07,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:07,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334670353] [2022-07-14 04:40:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:07,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:07,042 INFO L87 Difference]: Start difference. First operand 2827 states and 3839 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:40:09,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:11,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:14,602 INFO L93 Difference]: Finished difference Result 2827 states and 3839 transitions. [2022-07-14 04:40:14,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:14,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-14 04:40:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:14,619 INFO L225 Difference]: With dead ends: 2827 [2022-07-14 04:40:14,620 INFO L226 Difference]: Without dead ends: 2825 [2022-07-14 04:40:14,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:14,623 INFO L413 NwaCegarLoop]: 1747 mSDtfsCounter, 2818 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:14,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2986 Valid, 3471 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1711 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-14 04:40:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2022-07-14 04:40:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2825. [2022-07-14 04:40:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2029 states have (on average 1.2513553474618038) internal successors, (2539), 2064 states have internal predecessors, (2539), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:40:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3837 transitions. [2022-07-14 04:40:14,772 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3837 transitions. Word has length 168 [2022-07-14 04:40:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:14,773 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3837 transitions. [2022-07-14 04:40:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:40:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3837 transitions. [2022-07-14 04:40:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 04:40:14,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:14,777 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:14,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:40:14,777 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_gadget_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)] === [2022-07-14 04:40:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1664617640, now seen corresponding path program 1 times [2022-07-14 04:40:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548112684] [2022-07-14 04:40:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:40:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:40:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:40:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:40:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:15,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548112684] [2022-07-14 04:40:15,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548112684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:15,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:15,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776156491] [2022-07-14 04:40:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:15,152 INFO L87 Difference]: Start difference. First operand 2825 states and 3837 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 04:40:17,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:19,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:22,579 INFO L93 Difference]: Finished difference Result 2825 states and 3837 transitions. [2022-07-14 04:40:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-14 04:40:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:22,594 INFO L225 Difference]: With dead ends: 2825 [2022-07-14 04:40:22,594 INFO L226 Difference]: Without dead ends: 2823 [2022-07-14 04:40:22,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:22,598 INFO L413 NwaCegarLoop]: 1745 mSDtfsCounter, 2812 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:22,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2979 Valid, 3469 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:40:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-07-14 04:40:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2022-07-14 04:40:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2028 states have (on average 1.2509861932938855) internal successors, (2537), 2062 states have internal predecessors, (2537), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-14 04:40:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3835 transitions. [2022-07-14 04:40:22,750 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3835 transitions. Word has length 174 [2022-07-14 04:40:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:22,751 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 3835 transitions. [2022-07-14 04:40:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 04:40:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3835 transitions. [2022-07-14 04:40:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 04:40:22,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:22,755 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:22,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:40:22,756 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_urb_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)] === [2022-07-14 04:40:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 633874428, now seen corresponding path program 1 times [2022-07-14 04:40:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:22,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245985598] [2022-07-14 04:40:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:40:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:40:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:40:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:40:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:40:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:23,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245985598] [2022-07-14 04:40:23,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245985598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:23,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:23,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609110231] [2022-07-14 04:40:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:23,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:23,051 INFO L87 Difference]: Start difference. First operand 2823 states and 3835 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 04:40:25,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:27,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:30,358 INFO L93 Difference]: Finished difference Result 2823 states and 3835 transitions. [2022-07-14 04:40:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-14 04:40:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:30,375 INFO L225 Difference]: With dead ends: 2823 [2022-07-14 04:40:30,375 INFO L226 Difference]: Without dead ends: 2368 [2022-07-14 04:40:30,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:30,380 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2803 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2969 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:30,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2969 Valid, 3468 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:40:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-14 04:40:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-14 04:40:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1727 states have (on average 1.267515923566879) internal successors, (2189), 1754 states have internal predecessors, (2189), 525 states have call successors, (525), 115 states have call predecessors, (525), 114 states have return successors, (523), 519 states have call predecessors, (523), 523 states have call successors, (523) [2022-07-14 04:40:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3237 transitions. [2022-07-14 04:40:30,624 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3237 transitions. Word has length 180 [2022-07-14 04:40:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:30,625 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3237 transitions. [2022-07-14 04:40:30,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 04:40:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3237 transitions. [2022-07-14 04:40:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-14 04:40:30,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:30,635 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:30,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:40:30,636 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-14 04:40:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:30,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1967932840, now seen corresponding path program 1 times [2022-07-14 04:40:30,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:30,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582034335] [2022-07-14 04:40:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:40:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:40:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:40:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:40:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:40:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 04:40:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:40:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:40:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:40:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:40:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 04:40:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:40:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:40:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-14 04:40:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:40:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-14 04:40:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-14 04:40:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-14 04:40:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-14 04:40:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-14 04:40:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-14 04:40:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-14 04:40:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-14 04:40:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-14 04:40:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-14 04:40:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-14 04:40:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-14 04:40:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-14 04:40:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-14 04:40:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-14 04:40:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:31,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582034335] [2022-07-14 04:40:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582034335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:31,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:31,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:40:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760556500] [2022-07-14 04:40:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:40:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:40:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:40:31,383 INFO L87 Difference]: Start difference. First operand 2368 states and 3237 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-14 04:40:33,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:35,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []