./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--input--touchscreen--elants_i2c.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--input--touchscreen--elants_i2c.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 c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:37:43,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:37:43,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:37:43,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:37:43,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:37:43,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:37:43,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:37:43,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:37:43,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:37:43,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:37:43,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:37:43,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:37:43,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:37:43,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:37:43,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:37:43,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:37:43,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:37:43,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:37:43,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:37:43,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:37:43,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:37:43,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:37:43,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:37:43,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:37:43,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:37:43,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:37:43,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:37:43,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:37:43,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:37:43,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:37:43,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:37:43,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:37:43,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:37:43,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:37:43,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:37:43,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:37:43,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:37:43,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:37:43,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:37:43,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:37:43,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:37:43,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:37:43,188 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:37:43,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:37:43,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:37:43,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:37:43,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:37:43,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:37:43,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:37:43,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:37:43,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:37:43,211 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:37:43,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:37:43,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:37:43,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:37:43,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:37:43,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:37:43,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:37:43,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:37:43,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:37:43,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:37:43,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:37:43,216 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 -> c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 [2022-07-14 04:37:43,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:37:43,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:37:43,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:37:43,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:37:43,442 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:37:43,443 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--input--touchscreen--elants_i2c.ko.cil.i [2022-07-14 04:37:43,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45af25b6b/b9980acd3ad640b5bc89299ec903458d/FLAG7f8aa0611 [2022-07-14 04:37:44,102 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:37:44,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2022-07-14 04:37:44,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45af25b6b/b9980acd3ad640b5bc89299ec903458d/FLAG7f8aa0611 [2022-07-14 04:37:44,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45af25b6b/b9980acd3ad640b5bc89299ec903458d [2022-07-14 04:37:44,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:37:44,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:37:44,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:37:44,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:37:44,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:37:44,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:37:44" (1/1) ... [2022-07-14 04:37:44,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb6a59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:44, skipping insertion in model container [2022-07-14 04:37:44,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:37:44" (1/1) ... [2022-07-14 04:37:44,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:37:44,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:37:46,164 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--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2022-07-14 04:37:46,166 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--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2022-07-14 04:37:46,167 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--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2022-07-14 04:37:46,167 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--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2022-07-14 04:37:46,167 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--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2022-07-14 04:37:46,168 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--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2022-07-14 04:37:46,168 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--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2022-07-14 04:37:46,175 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--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2022-07-14 04:37:46,175 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--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2022-07-14 04:37:46,176 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--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2022-07-14 04:37:46,176 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--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2022-07-14 04:37:46,177 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--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2022-07-14 04:37:46,177 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--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2022-07-14 04:37:46,177 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--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2022-07-14 04:37:46,178 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--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2022-07-14 04:37:46,178 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--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2022-07-14 04:37:46,178 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--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2022-07-14 04:37:46,179 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--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2022-07-14 04:37:46,180 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--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2022-07-14 04:37:46,180 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--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2022-07-14 04:37:46,180 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--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2022-07-14 04:37:46,181 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--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2022-07-14 04:37:46,181 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--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2022-07-14 04:37:46,181 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--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2022-07-14 04:37:46,183 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--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2022-07-14 04:37:46,183 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--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2022-07-14 04:37:46,184 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--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2022-07-14 04:37:46,184 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--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2022-07-14 04:37:46,185 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--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2022-07-14 04:37:46,185 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--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2022-07-14 04:37:46,186 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--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2022-07-14 04:37:46,187 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--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2022-07-14 04:37:46,187 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--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2022-07-14 04:37:46,187 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--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2022-07-14 04:37:46,188 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--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2022-07-14 04:37:46,188 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--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2022-07-14 04:37:46,189 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--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2022-07-14 04:37:46,189 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--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2022-07-14 04:37:46,189 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--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2022-07-14 04:37:46,190 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--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2022-07-14 04:37:46,190 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--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2022-07-14 04:37:46,190 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--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2022-07-14 04:37:46,191 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--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2022-07-14 04:37:46,191 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--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2022-07-14 04:37:46,191 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--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2022-07-14 04:37:46,192 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--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2022-07-14 04:37:46,192 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--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2022-07-14 04:37:46,193 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--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2022-07-14 04:37:46,193 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--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2022-07-14 04:37:46,194 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--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2022-07-14 04:37:46,194 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--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2022-07-14 04:37:46,194 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--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2022-07-14 04:37:46,195 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--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2022-07-14 04:37:46,195 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--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2022-07-14 04:37:46,195 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--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2022-07-14 04:37:46,196 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--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2022-07-14 04:37:46,196 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--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2022-07-14 04:37:46,197 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--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2022-07-14 04:37:46,197 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--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2022-07-14 04:37:46,197 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--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2022-07-14 04:37:46,197 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--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2022-07-14 04:37:46,198 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--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2022-07-14 04:37:46,199 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--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2022-07-14 04:37:46,199 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--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2022-07-14 04:37:46,200 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--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2022-07-14 04:37:46,200 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--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2022-07-14 04:37:46,200 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--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2022-07-14 04:37:46,201 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--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2022-07-14 04:37:46,201 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--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2022-07-14 04:37:46,201 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--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2022-07-14 04:37:46,201 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--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2022-07-14 04:37:46,202 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--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2022-07-14 04:37:46,202 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--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2022-07-14 04:37:46,202 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--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2022-07-14 04:37:46,203 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--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2022-07-14 04:37:46,203 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--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2022-07-14 04:37:46,203 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--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2022-07-14 04:37:46,203 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--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2022-07-14 04:37:46,204 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--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2022-07-14 04:37:46,204 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--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2022-07-14 04:37:46,205 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--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2022-07-14 04:37:46,205 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--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2022-07-14 04:37:46,205 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--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2022-07-14 04:37:46,206 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--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2022-07-14 04:37:46,206 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--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2022-07-14 04:37:46,206 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--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2022-07-14 04:37:46,207 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--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2022-07-14 04:37:46,207 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--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2022-07-14 04:37:46,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:37:46,249 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:37:46,462 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--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2022-07-14 04:37:46,463 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--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2022-07-14 04:37:46,463 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--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2022-07-14 04:37:46,463 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--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2022-07-14 04:37:46,463 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--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2022-07-14 04:37:46,464 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--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2022-07-14 04:37:46,464 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--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2022-07-14 04:37:46,464 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--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2022-07-14 04:37:46,465 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--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2022-07-14 04:37:46,465 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--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2022-07-14 04:37:46,465 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--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2022-07-14 04:37:46,466 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--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2022-07-14 04:37:46,466 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--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2022-07-14 04:37:46,466 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--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2022-07-14 04:37:46,467 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--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2022-07-14 04:37:46,467 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--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2022-07-14 04:37:46,467 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--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2022-07-14 04:37:46,467 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--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2022-07-14 04:37:46,468 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--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2022-07-14 04:37:46,468 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--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2022-07-14 04:37:46,468 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--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2022-07-14 04:37:46,468 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--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2022-07-14 04:37:46,469 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--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2022-07-14 04:37:46,469 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--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2022-07-14 04:37:46,469 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--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2022-07-14 04:37:46,470 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--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2022-07-14 04:37:46,470 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--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2022-07-14 04:37:46,470 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--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2022-07-14 04:37:46,471 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--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2022-07-14 04:37:46,471 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--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2022-07-14 04:37:46,471 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--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2022-07-14 04:37:46,471 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--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2022-07-14 04:37:46,472 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--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2022-07-14 04:37:46,472 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--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2022-07-14 04:37:46,472 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--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2022-07-14 04:37:46,473 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--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2022-07-14 04:37:46,473 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--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2022-07-14 04:37:46,473 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--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2022-07-14 04:37:46,474 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--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2022-07-14 04:37:46,474 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--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2022-07-14 04:37:46,474 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--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2022-07-14 04:37:46,475 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--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2022-07-14 04:37:46,475 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--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2022-07-14 04:37:46,475 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--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2022-07-14 04:37:46,476 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--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2022-07-14 04:37:46,476 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--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2022-07-14 04:37:46,476 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--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2022-07-14 04:37:46,477 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--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2022-07-14 04:37:46,477 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--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2022-07-14 04:37:46,477 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--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2022-07-14 04:37:46,478 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--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2022-07-14 04:37:46,478 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--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2022-07-14 04:37:46,478 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--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2022-07-14 04:37:46,478 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--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2022-07-14 04:37:46,479 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--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2022-07-14 04:37:46,479 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--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2022-07-14 04:37:46,479 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--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2022-07-14 04:37:46,480 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--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2022-07-14 04:37:46,480 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--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2022-07-14 04:37:46,480 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--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2022-07-14 04:37:46,481 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--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2022-07-14 04:37:46,481 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--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2022-07-14 04:37:46,481 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--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2022-07-14 04:37:46,482 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--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2022-07-14 04:37:46,482 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--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2022-07-14 04:37:46,482 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--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2022-07-14 04:37:46,483 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--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2022-07-14 04:37:46,483 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--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2022-07-14 04:37:46,483 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--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2022-07-14 04:37:46,484 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--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2022-07-14 04:37:46,484 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--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2022-07-14 04:37:46,484 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--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2022-07-14 04:37:46,485 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--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2022-07-14 04:37:46,485 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--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2022-07-14 04:37:46,485 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--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2022-07-14 04:37:46,486 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--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2022-07-14 04:37:46,486 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--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2022-07-14 04:37:46,486 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--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2022-07-14 04:37:46,487 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--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2022-07-14 04:37:46,487 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--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2022-07-14 04:37:46,487 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--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2022-07-14 04:37:46,488 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--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2022-07-14 04:37:46,488 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--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2022-07-14 04:37:46,488 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--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2022-07-14 04:37:46,489 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--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2022-07-14 04:37:46,489 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--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2022-07-14 04:37:46,489 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--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2022-07-14 04:37:46,490 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--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2022-07-14 04:37:46,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:37:46,617 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:37:46,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46 WrapperNode [2022-07-14 04:37:46,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:37:46,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:37:46,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:37:46,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:37:46,624 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:37:46" (1/1) ... [2022-07-14 04:37:46,693 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:37:46" (1/1) ... [2022-07-14 04:37:46,792 INFO L137 Inliner]: procedures = 537, calls = 1891, calls flagged for inlining = 255, calls inlined = 172, statements flattened = 4095 [2022-07-14 04:37:46,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:37:46,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:37:46,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:37:46,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:37:46,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:37:46,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:37:46,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:37:46,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:37:46,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (1/1) ... [2022-07-14 04:37:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:37:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:37:46,950 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:37:46,971 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:37:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-14 04:37:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-14 04:37:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:37:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:37:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:37:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:37:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:37:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:37:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:37:46,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:37:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:37:46,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:37:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_parse_version [2022-07-14 04:37:46,990 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_parse_version [2022-07-14 04:37:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-14 04:37:46,990 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-14 04:37:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 04:37:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:37:46,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:37:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_remove_sysfs_group [2022-07-14 04:37:46,991 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_remove_sysfs_group [2022-07-14 04:37:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:37:46,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:37:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:37:46,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:37:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:37:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:37:46,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_set_res [2022-07-14 04:37:46,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_set_res [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure write_update_fw [2022-07-14 04:37:46,992 INFO L138 BoogieDeclarations]: Found implementation of procedure write_update_fw [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:37:46,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:37:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:37:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:37:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:37:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:37:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:37:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-14 04:37:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-14 04:37:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:37:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:37:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_suspend [2022-07-14 04:37:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_suspend [2022-07-14 04:37:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:37:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:37:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:37:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:37:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:37:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:37:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:37:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:37:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:37:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:37:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:37:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:37:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:37:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2022-07-14 04:37:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:37:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_send [2022-07-14 04:37:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_send [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:37:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-14 04:37:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:37:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:37:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:37:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:37:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure elants_version_attribute_show [2022-07-14 04:37:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_version_attribute_show [2022-07-14 04:37:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2022-07-14 04:37:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2022-07-14 04:37:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_sw_reset [2022-07-14 04:37:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_sw_reset [2022-07-14 04:37:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:37:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:37:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_calibrate [2022-07-14 04:37:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_calibrate [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:37:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:37:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-14 04:37:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-14 04:37:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:37:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_resume [2022-07-14 04:37:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_resume [2022-07-14 04:37:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure calibrate_store [2022-07-14 04:37:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure calibrate_store [2022-07-14 04:37:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:37:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:37:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:37:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:37:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:37:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:37:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:37:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:37:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:37:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:37:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-14 04:37:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-14 04:37:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-14 04:37:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-14 04:37:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:37:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:37:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:37:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:37:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:37:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:37:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:37:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_initialize [2022-07-14 04:37:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_initialize [2022-07-14 04:37:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:37:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:37:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-14 04:37:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-14 04:37:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2022-07-14 04:37:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2022-07-14 04:37:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:37:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:37:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-14 04:37:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-14 04:37:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_read [2022-07-14 04:37:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_read [2022-07-14 04:37:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-07-14 04:37:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-07-14 04:37:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-14 04:37:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-14 04:37:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-14 04:37:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-14 04:37:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_execute_command [2022-07-14 04:37:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_execute_command [2022-07-14 04:37:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:37:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:37:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:37:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:37:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:37:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_event [2022-07-14 04:37:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_event [2022-07-14 04:37:47,442 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:37:47,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:37:47,598 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:37:57,264 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:37:57,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:37:57,293 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:37:57,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:37:57 BoogieIcfgContainer [2022-07-14 04:37:57,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:37:57,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:37:57,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:37:57,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:37:57,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:37:44" (1/3) ... [2022-07-14 04:37:57,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6247610a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:37:57, skipping insertion in model container [2022-07-14 04:37:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:37:46" (2/3) ... [2022-07-14 04:37:57,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6247610a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:37:57, skipping insertion in model container [2022-07-14 04:37:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:37:57" (3/3) ... [2022-07-14 04:37:57,318 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2022-07-14 04:37:57,328 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:37:57,328 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 04:37:57,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:37:57,384 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@28cac674, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63a0231 [2022-07-14 04:37:57,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 04:37:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 798 states have (on average 1.299498746867168) internal successors, (1037), 843 states have internal predecessors, (1037), 270 states have call successors, (270), 65 states have call predecessors, (270), 64 states have return successors, (265), 265 states have call predecessors, (265), 265 states have call successors, (265) [2022-07-14 04:37:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:37:57,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:57,398 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:37:57,398 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 25 more)] === [2022-07-14 04:37:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 397725343, now seen corresponding path program 1 times [2022-07-14 04:37:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370032191] [2022-07-14 04:37:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:57,944 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:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:57,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370032191] [2022-07-14 04:37:57,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370032191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:57,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:57,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19767115] [2022-07-14 04:37:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:57,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:57,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:57,978 INFO L87 Difference]: Start difference. First operand has 1160 states, 798 states have (on average 1.299498746867168) internal successors, (1037), 843 states have internal predecessors, (1037), 270 states have call successors, (270), 65 states have call predecessors, (270), 64 states have return successors, (265), 265 states have call predecessors, (265), 265 states have call successors, (265) 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:38:00,016 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:02,039 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:06,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:07,253 INFO L93 Difference]: Finished difference Result 2289 states and 3162 transitions. [2022-07-14 04:38:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:07,255 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:38:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:07,270 INFO L225 Difference]: With dead ends: 2289 [2022-07-14 04:38:07,270 INFO L226 Difference]: Without dead ends: 1142 [2022-07-14 04:38:07,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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:07,279 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2301 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 914 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:07,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 2901 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 1372 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2022-07-14 04:38:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-14 04:38:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-14 04:38:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 788 states have (on average 1.2576142131979695) internal successors, (991), 828 states have internal predecessors, (991), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1519 transitions. [2022-07-14 04:38:07,398 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1519 transitions. Word has length 64 [2022-07-14 04:38:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:07,399 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1519 transitions. [2022-07-14 04:38:07,399 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:38:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1519 transitions. [2022-07-14 04:38:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:38:07,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:07,401 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:38:07,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:38:07,402 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 25 more)] === [2022-07-14 04:38:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1378894902, now seen corresponding path program 1 times [2022-07-14 04:38:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:07,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785082272] [2022-07-14 04:38:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:07,678 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:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:07,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785082272] [2022-07-14 04:38:07,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785082272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:07,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:07,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:07,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262133404] [2022-07-14 04:38:07,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:07,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:07,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:07,683 INFO L87 Difference]: Start difference. First operand 1142 states and 1519 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:38:09,713 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:11,729 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:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:14,704 INFO L93 Difference]: Finished difference Result 1142 states and 1519 transitions. [2022-07-14 04:38:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:14,705 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:38:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:14,710 INFO L225 Difference]: With dead ends: 1142 [2022-07-14 04:38:14,710 INFO L226 Difference]: Without dead ends: 1140 [2022-07-14 04:38:14,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:14,712 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 2267 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 2861 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1359 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:38:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-14 04:38:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-14 04:38:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 787 states have (on average 1.2566709021601017) internal successors, (989), 826 states have internal predecessors, (989), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1517 transitions. [2022-07-14 04:38:14,750 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1517 transitions. Word has length 70 [2022-07-14 04:38:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:14,752 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1517 transitions. [2022-07-14 04:38:14,752 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:38:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1517 transitions. [2022-07-14 04:38:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:38:14,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:14,760 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:38:14,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:38:14,760 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 25 more)] === [2022-07-14 04:38:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1387426283, now seen corresponding path program 1 times [2022-07-14 04:38:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206921719] [2022-07-14 04:38:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:15,027 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:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206921719] [2022-07-14 04:38:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206921719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:15,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:15,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020836492] [2022-07-14 04:38:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:15,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:15,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:15,030 INFO L87 Difference]: Start difference. First operand 1140 states and 1517 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:38:17,052 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:19,068 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:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:22,015 INFO L93 Difference]: Finished difference Result 1140 states and 1517 transitions. [2022-07-14 04:38:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:22,015 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:38:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:22,020 INFO L225 Difference]: With dead ends: 1140 [2022-07-14 04:38:22,021 INFO L226 Difference]: Without dead ends: 1138 [2022-07-14 04:38:22,021 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:38:22,022 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 2261 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:22,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 2859 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1357 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:38:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-07-14 04:38:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-07-14 04:38:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 786 states have (on average 1.2557251908396947) internal successors, (987), 824 states have internal predecessors, (987), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1515 transitions. [2022-07-14 04:38:22,054 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1515 transitions. Word has length 76 [2022-07-14 04:38:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:22,054 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1515 transitions. [2022-07-14 04:38:22,055 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:38:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1515 transitions. [2022-07-14 04:38:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:38:22,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:22,056 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:38:22,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:38:22,056 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 25 more)] === [2022-07-14 04:38:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1256211171, now seen corresponding path program 1 times [2022-07-14 04:38:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:22,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067561988] [2022-07-14 04:38:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:22,238 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:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067561988] [2022-07-14 04:38:22,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067561988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:22,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:22,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893052794] [2022-07-14 04:38:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:22,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:22,241 INFO L87 Difference]: Start difference. First operand 1138 states and 1515 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:38:24,262 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:26,281 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:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:29,195 INFO L93 Difference]: Finished difference Result 1138 states and 1515 transitions. [2022-07-14 04:38:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:29,195 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:38:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:29,201 INFO L225 Difference]: With dead ends: 1138 [2022-07-14 04:38:29,201 INFO L226 Difference]: Without dead ends: 1136 [2022-07-14 04:38:29,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:29,203 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2255 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:29,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 2857 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1355 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-14 04:38:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-07-14 04:38:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1136. [2022-07-14 04:38:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 785 states have (on average 1.2547770700636942) internal successors, (985), 822 states have internal predecessors, (985), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1513 transitions. [2022-07-14 04:38:29,240 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1513 transitions. Word has length 82 [2022-07-14 04:38:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:29,240 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1513 transitions. [2022-07-14 04:38:29,241 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:38:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1513 transitions. [2022-07-14 04:38:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:38:29,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:29,242 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:38:29,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:38:29,242 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 25 more)] === [2022-07-14 04:38:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1973731712, now seen corresponding path program 1 times [2022-07-14 04:38:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:29,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168258780] [2022-07-14 04:38:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:29,430 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:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:29,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168258780] [2022-07-14 04:38:29,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168258780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:29,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:29,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192329980] [2022-07-14 04:38:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:29,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:29,433 INFO L87 Difference]: Start difference. First operand 1136 states and 1513 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:38:31,455 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:33,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:38:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:36,309 INFO L93 Difference]: Finished difference Result 1136 states and 1513 transitions. [2022-07-14 04:38:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:36,309 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:38:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:36,314 INFO L225 Difference]: With dead ends: 1136 [2022-07-14 04:38:36,314 INFO L226 Difference]: Without dead ends: 1134 [2022-07-14 04:38:36,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:36,316 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 2249 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:36,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 2855 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1353 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-14 04:38:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-14 04:38:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2022-07-14 04:38:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 784 states have (on average 1.253826530612245) internal successors, (983), 820 states have internal predecessors, (983), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1511 transitions. [2022-07-14 04:38:36,345 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1511 transitions. Word has length 88 [2022-07-14 04:38:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:36,346 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1511 transitions. [2022-07-14 04:38:36,346 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:38:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1511 transitions. [2022-07-14 04:38:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:38:36,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:36,351 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:38:36,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:38:36,352 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 25 more)] === [2022-07-14 04:38:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1678572572, now seen corresponding path program 1 times [2022-07-14 04:38:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:36,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30761913] [2022-07-14 04:38:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:36,515 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:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:36,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30761913] [2022-07-14 04:38:36,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30761913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:36,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:36,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995710080] [2022-07-14 04:38:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:36,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:36,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:36,518 INFO L87 Difference]: Start difference. First operand 1134 states and 1511 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:38:38,538 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:40,558 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:44,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:38:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:45,837 INFO L93 Difference]: Finished difference Result 1134 states and 1511 transitions. [2022-07-14 04:38:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:45,838 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:38:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:45,842 INFO L225 Difference]: With dead ends: 1134 [2022-07-14 04:38:45,842 INFO L226 Difference]: Without dead ends: 1132 [2022-07-14 04:38:45,842 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:38:45,843 INFO L413 NwaCegarLoop]: 1413 mSDtfsCounter, 2243 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:45,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2853 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1350 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-14 04:38:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-07-14 04:38:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2022-07-14 04:38:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 783 states have (on average 1.2528735632183907) internal successors, (981), 818 states have internal predecessors, (981), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 04:38:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1509 transitions. [2022-07-14 04:38:45,873 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1509 transitions. Word has length 94 [2022-07-14 04:38:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:45,873 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1509 transitions. [2022-07-14 04:38:45,873 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:38:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1509 transitions. [2022-07-14 04:38:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:38:45,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:45,875 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:38:45,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:38:45,875 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 25 more)] === [2022-07-14 04:38:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 955210123, now seen corresponding path program 1 times [2022-07-14 04:38:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:45,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779754668] [2022-07-14 04:38:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:46,021 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:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779754668] [2022-07-14 04:38:46,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779754668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:46,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:46,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98065683] [2022-07-14 04:38:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:46,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:46,023 INFO L87 Difference]: Start difference. First operand 1132 states and 1509 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:38:48,043 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:50,064 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:54,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:58,248 INFO L93 Difference]: Finished difference Result 2235 states and 2981 transitions. [2022-07-14 04:38:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:38:58,249 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:38:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:58,258 INFO L225 Difference]: With dead ends: 2235 [2022-07-14 04:38:58,258 INFO L226 Difference]: Without dead ends: 2233 [2022-07-14 04:38:58,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:38:58,260 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 3329 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 1608 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 4549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:58,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 3580 Invalid, 4549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 2938 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-07-14 04:38:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-07-14 04:38:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2096. [2022-07-14 04:38:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1470 states have (on average 1.2578231292517006) internal successors, (1849), 1520 states have internal predecessors, (1849), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:38:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2833 transitions. [2022-07-14 04:38:58,335 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2833 transitions. Word has length 100 [2022-07-14 04:38:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:58,336 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2833 transitions. [2022-07-14 04:38:58,336 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:38:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2833 transitions. [2022-07-14 04:38:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:38:58,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:58,338 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:38:58,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:38:58,338 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 25 more)] === [2022-07-14 04:38:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 474370401, now seen corresponding path program 1 times [2022-07-14 04:38:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195393281] [2022-07-14 04:38:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:38:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:38:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:38:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:38:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:38:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:38:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:38:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:38:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:38:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:38:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:38:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:38:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:38:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:58,508 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,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195393281] [2022-07-14 04:38:58,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195393281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:58,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:58,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603888984] [2022-07-14 04:38:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:58,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:58,510 INFO L87 Difference]: Start difference. First operand 2096 states and 2833 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:39:00,530 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:02,553 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:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:05,566 INFO L93 Difference]: Finished difference Result 2096 states and 2833 transitions. [2022-07-14 04:39:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:05,567 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:39:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:05,575 INFO L225 Difference]: With dead ends: 2096 [2022-07-14 04:39:05,575 INFO L226 Difference]: Without dead ends: 2094 [2022-07-14 04:39:05,577 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:39:05,577 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2241 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 2851 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1345 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:39:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-07-14 04:39:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2022-07-14 04:39:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1469 states have (on average 1.2573179033356026) internal successors, (1847), 1518 states have internal predecessors, (1847), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2831 transitions. [2022-07-14 04:39:05,657 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2831 transitions. Word has length 106 [2022-07-14 04:39:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:05,657 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 2831 transitions. [2022-07-14 04:39:05,657 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:39:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2831 transitions. [2022-07-14 04:39:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:39:05,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:05,659 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:39:05,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:39:05,660 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 25 more)] === [2022-07-14 04:39:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 603557956, now seen corresponding path program 1 times [2022-07-14 04:39:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:05,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453323231] [2022-07-14 04:39:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:05,840 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 1 [2022-07-14 04:39:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:05,885 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,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:05,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453323231] [2022-07-14 04:39:05,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453323231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:05,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:05,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455615807] [2022-07-14 04:39:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:05,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:05,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:05,888 INFO L87 Difference]: Start difference. First operand 2094 states and 2831 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:39:07,915 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,930 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:14,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:15,233 INFO L93 Difference]: Finished difference Result 2094 states and 2831 transitions. [2022-07-14 04:39:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:15,234 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:39:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:15,264 INFO L225 Difference]: With dead ends: 2094 [2022-07-14 04:39:15,264 INFO L226 Difference]: Without dead ends: 2092 [2022-07-14 04:39:15,265 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:39:15,267 INFO L413 NwaCegarLoop]: 1409 mSDtfsCounter, 2229 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:15,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 2849 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1346 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-14 04:39:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2022-07-14 04:39:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2092. [2022-07-14 04:39:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1468 states have (on average 1.2568119891008174) internal successors, (1845), 1516 states have internal predecessors, (1845), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2829 transitions. [2022-07-14 04:39:15,333 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2829 transitions. Word has length 108 [2022-07-14 04:39:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:15,333 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2829 transitions. [2022-07-14 04:39:15,333 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:39:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2829 transitions. [2022-07-14 04:39:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-14 04:39:15,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:15,336 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:39:15,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:39:15,336 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:39:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -998949483, now seen corresponding path program 1 times [2022-07-14 04:39:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:15,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025178926] [2022-07-14 04:39:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:39:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:39:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:39:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:39:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:15,545 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:39:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:15,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025178926] [2022-07-14 04:39:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025178926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:15,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:15,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079359836] [2022-07-14 04:39:15,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:15,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:15,547 INFO L87 Difference]: Start difference. First operand 2092 states and 2829 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:39:17,572 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:19,595 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:21,613 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:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:24,358 INFO L93 Difference]: Finished difference Result 3620 states and 4844 transitions. [2022-07-14 04:39:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:39:24,358 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:39:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:24,369 INFO L225 Difference]: With dead ends: 3620 [2022-07-14 04:39:24,369 INFO L226 Difference]: Without dead ends: 2098 [2022-07-14 04:39:24,374 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:39:24,374 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 2454 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 1216 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1216 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:24,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 2463 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1216 Valid, 1196 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-07-14 04:39:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-07-14 04:39:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2086. [2022-07-14 04:39:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 1463 states have (on average 1.2549555707450444) internal successors, (1836), 1510 states have internal predecessors, (1836), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2820 transitions. [2022-07-14 04:39:24,440 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2820 transitions. Word has length 129 [2022-07-14 04:39:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:24,441 INFO L495 AbstractCegarLoop]: Abstraction has 2086 states and 2820 transitions. [2022-07-14 04:39:24,441 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:39:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2820 transitions. [2022-07-14 04:39:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:39:24,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:24,442 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:39:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:39:24,443 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 25 more)] === [2022-07-14 04:39:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -576112153, now seen corresponding path program 1 times [2022-07-14 04:39:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:24,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75456422] [2022-07-14 04:39:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:24,644 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:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75456422] [2022-07-14 04:39:24,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75456422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:24,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:24,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932885660] [2022-07-14 04:39:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:24,646 INFO L87 Difference]: Start difference. First operand 2086 states and 2820 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:39:26,667 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:28,685 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:32,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:33,514 INFO L93 Difference]: Finished difference Result 2086 states and 2820 transitions. [2022-07-14 04:39:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:33,515 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:39:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:33,522 INFO L225 Difference]: With dead ends: 2086 [2022-07-14 04:39:33,523 INFO L226 Difference]: Without dead ends: 2084 [2022-07-14 04:39:33,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:33,524 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2220 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:33,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 2828 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1343 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-07-14 04:39:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2022-07-14 04:39:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2022-07-14 04:39:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1462 states have (on average 1.2544459644322845) internal successors, (1834), 1508 states have internal predecessors, (1834), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2818 transitions. [2022-07-14 04:39:33,590 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2818 transitions. Word has length 114 [2022-07-14 04:39:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:33,590 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2818 transitions. [2022-07-14 04:39:33,590 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:39:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2818 transitions. [2022-07-14 04:39:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-14 04:39:33,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:33,592 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:39:33,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:39:33,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:39:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -227467516, now seen corresponding path program 1 times [2022-07-14 04:39:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:33,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084525417] [2022-07-14 04:39:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:39:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:39:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:39:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:39:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:39:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:39:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 04:39:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:33,806 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:39:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084525417] [2022-07-14 04:39:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084525417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:39:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287965924] [2022-07-14 04:39:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:33,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:39:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:33,808 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:39:33,809 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:39:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:34,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:39:34,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:39:34,549 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:39:34,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:39:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287965924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:34,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:39:34,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:39:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414240432] [2022-07-14 04:39:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:34,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:39:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:39:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:34,551 INFO L87 Difference]: Start difference. First operand 2084 states and 2818 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:39:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:34,662 INFO L93 Difference]: Finished difference Result 3592 states and 4804 transitions. [2022-07-14 04:39:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:39:34,662 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:39:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:34,669 INFO L225 Difference]: With dead ends: 3592 [2022-07-14 04:39:34,670 INFO L226 Difference]: Without dead ends: 2078 [2022-07-14 04:39:34,673 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:39:34,674 INFO L413 NwaCegarLoop]: 1492 mSDtfsCounter, 1478 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1492 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:39:34,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1492 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:39:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-07-14 04:39:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2022-07-14 04:39:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1457 states have (on average 1.2525737817433082) internal successors, (1825), 1502 states have internal predecessors, (1825), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2809 transitions. [2022-07-14 04:39:34,749 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2809 transitions. Word has length 135 [2022-07-14 04:39:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:34,749 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2809 transitions. [2022-07-14 04:39:34,749 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:39:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2809 transitions. [2022-07-14 04:39:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:39:34,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:34,751 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:39:34,778 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:39:34,951 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:39:34,952 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 25 more)] === [2022-07-14 04:39:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 920618242, now seen corresponding path program 1 times [2022-07-14 04:39:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232101361] [2022-07-14 04:39:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:35,112 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:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:35,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232101361] [2022-07-14 04:39:35,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232101361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:35,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:35,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210275285] [2022-07-14 04:39:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:35,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:35,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:35,113 INFO L87 Difference]: Start difference. First operand 2078 states and 2809 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:39:37,133 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:39,155 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:43,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:45,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:45,367 INFO L93 Difference]: Finished difference Result 2078 states and 2809 transitions. [2022-07-14 04:39:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:45,367 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:39:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:45,375 INFO L225 Difference]: With dead ends: 2078 [2022-07-14 04:39:45,375 INFO L226 Difference]: Without dead ends: 2076 [2022-07-14 04:39:45,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:45,376 INFO L413 NwaCegarLoop]: 1395 mSDtfsCounter, 2209 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:45,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2807 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1340 Invalid, 3 Unknown, 0 Unchecked, 10.1s Time] [2022-07-14 04:39:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-14 04:39:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2076. [2022-07-14 04:39:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1456 states have (on average 1.2520604395604396) internal successors, (1823), 1500 states have internal predecessors, (1823), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2807 transitions. [2022-07-14 04:39:45,453 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2807 transitions. Word has length 120 [2022-07-14 04:39:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:45,454 INFO L495 AbstractCegarLoop]: Abstraction has 2076 states and 2807 transitions. [2022-07-14 04:39:45,454 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:39:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2807 transitions. [2022-07-14 04:39:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:39:45,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:45,456 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:39:45,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:39:45,456 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 25 more)] === [2022-07-14 04:39:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1966366827, now seen corresponding path program 1 times [2022-07-14 04:39:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:45,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550146120] [2022-07-14 04:39:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:45,669 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:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:45,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550146120] [2022-07-14 04:39:45,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550146120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:45,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414024102] [2022-07-14 04:39:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:45,671 INFO L87 Difference]: Start difference. First operand 2076 states and 2807 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:39:47,692 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:49,713 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:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:52,400 INFO L93 Difference]: Finished difference Result 2076 states and 2807 transitions. [2022-07-14 04:39:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:52,401 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:39:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:52,407 INFO L225 Difference]: With dead ends: 2076 [2022-07-14 04:39:52,407 INFO L226 Difference]: Without dead ends: 2074 [2022-07-14 04:39:52,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:52,409 INFO L413 NwaCegarLoop]: 1393 mSDtfsCounter, 2203 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:52,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 2805 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1339 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:39:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-07-14 04:39:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2022-07-14 04:39:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1455 states have (on average 1.2515463917525773) internal successors, (1821), 1498 states have internal predecessors, (1821), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:39:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2805 transitions. [2022-07-14 04:39:52,478 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2805 transitions. Word has length 126 [2022-07-14 04:39:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:52,478 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2805 transitions. [2022-07-14 04:39:52,478 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:39:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2805 transitions. [2022-07-14 04:39:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:39:52,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:52,480 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:39:52,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:39:52,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 25 more)] === [2022-07-14 04:39:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1374776284, now seen corresponding path program 1 times [2022-07-14 04:39:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044169173] [2022-07-14 04:39:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:39:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:39:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:39:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:39:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:39:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:39:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:39:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:39:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:39:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:39:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:39:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:39:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:39:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:39:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:39:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:39:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:52,652 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:52,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044169173] [2022-07-14 04:39:52,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044169173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:52,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:52,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214383222] [2022-07-14 04:39:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:52,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:52,655 INFO L87 Difference]: Start difference. First operand 2074 states and 2805 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:54,676 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:56,705 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:00,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:01,847 INFO L93 Difference]: Finished difference Result 2074 states and 2805 transitions. [2022-07-14 04:40:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:01,847 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:40:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:01,855 INFO L225 Difference]: With dead ends: 2074 [2022-07-14 04:40:01,855 INFO L226 Difference]: Without dead ends: 2072 [2022-07-14 04:40:01,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:01,856 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2197 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:01,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 2803 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1336 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2022-07-14 04:40:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-14 04:40:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-14 04:40:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1454 states have (on average 1.251031636863824) internal successors, (1819), 1496 states have internal predecessors, (1819), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:40:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2803 transitions. [2022-07-14 04:40:01,975 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2803 transitions. Word has length 132 [2022-07-14 04:40:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:01,975 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2803 transitions. [2022-07-14 04:40:01,975 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:40:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2803 transitions. [2022-07-14 04:40:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:40:01,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:01,977 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:40:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:40:01,978 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 25 more)] === [2022-07-14 04:40:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 311265212, now seen corresponding path program 1 times [2022-07-14 04:40:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:01,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807272577] [2022-07-14 04:40:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,147 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:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:02,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807272577] [2022-07-14 04:40:02,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807272577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:02,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:02,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028437132] [2022-07-14 04:40:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:02,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:02,149 INFO L87 Difference]: Start difference. First operand 2072 states and 2803 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:40:04,169 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:06,197 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:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:09,355 INFO L93 Difference]: Finished difference Result 2072 states and 2803 transitions. [2022-07-14 04:40:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:09,355 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:40:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:09,362 INFO L225 Difference]: With dead ends: 2072 [2022-07-14 04:40:09,363 INFO L226 Difference]: Without dead ends: 2070 [2022-07-14 04:40:09,363 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:40:09,364 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 2191 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:09,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 2801 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1335 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:40:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-07-14 04:40:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2022-07-14 04:40:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1453 states have (on average 1.250516173434274) internal successors, (1817), 1494 states have internal predecessors, (1817), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-14 04:40:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2801 transitions. [2022-07-14 04:40:09,448 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2801 transitions. Word has length 138 [2022-07-14 04:40:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:09,448 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 2801 transitions. [2022-07-14 04:40:09,448 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:40:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2801 transitions. [2022-07-14 04:40:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-14 04:40:09,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:09,451 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:40:09,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 25 more)] === [2022-07-14 04:40:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 86212839, now seen corresponding path program 1 times [2022-07-14 04:40:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538963788] [2022-07-14 04:40:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:40:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:40:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:40:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:40:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:40:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:40:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:40:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:40:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:40:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2022-07-14 04:40:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:09,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538963788] [2022-07-14 04:40:09,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538963788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:09,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:09,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71214180] [2022-07-14 04:40:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:09,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:09,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:09,738 INFO L87 Difference]: Start difference. First operand 2070 states and 2801 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:40:11,759 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:13,779 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:15,799 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:22,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:24,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:29,337 INFO L93 Difference]: Finished difference Result 3069 states and 4118 transitions. [2022-07-14 04:40:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:40:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2022-07-14 04:40:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:29,345 INFO L225 Difference]: With dead ends: 3069 [2022-07-14 04:40:29,346 INFO L226 Difference]: Without dead ends: 3067 [2022-07-14 04:40:29,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-14 04:40:29,347 INFO L413 NwaCegarLoop]: 1590 mSDtfsCounter, 3106 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 1596 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3259 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 5917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:29,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3259 Valid, 4156 Invalid, 5917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 4316 Invalid, 5 Unknown, 0 Unchecked, 19.3s Time] [2022-07-14 04:40:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2022-07-14 04:40:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3010. [2022-07-14 04:40:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2115 states have (on average 1.2501182033096927) internal successors, (2644), 2174 states have internal predecessors, (2644), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:40:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4056 transitions. [2022-07-14 04:40:29,456 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 4056 transitions. Word has length 183 [2022-07-14 04:40:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:29,456 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 4056 transitions. [2022-07-14 04:40:29,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:40:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 4056 transitions. [2022-07-14 04:40:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:40:29,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:29,459 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:40:29,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:40:29,459 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 25 more)] === [2022-07-14 04:40:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 268626821, now seen corresponding path program 1 times [2022-07-14 04:40:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:29,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931093851] [2022-07-14 04:40:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:29,636 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:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:29,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931093851] [2022-07-14 04:40:29,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931093851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:29,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:29,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534249376] [2022-07-14 04:40:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:29,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:29,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:29,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:29,639 INFO L87 Difference]: Start difference. First operand 3010 states and 4056 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:40:31,660 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:33,687 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:38,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:39,285 INFO L93 Difference]: Finished difference Result 3010 states and 4056 transitions. [2022-07-14 04:40:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:39,286 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:40:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:39,297 INFO L225 Difference]: With dead ends: 3010 [2022-07-14 04:40:39,297 INFO L226 Difference]: Without dead ends: 3008 [2022-07-14 04:40:39,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 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:39,298 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 2185 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:39,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 2799 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1332 Invalid, 3 Unknown, 0 Unchecked, 9.4s Time] [2022-07-14 04:40:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-07-14 04:40:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2022-07-14 04:40:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2114 states have (on average 1.249290444654683) internal successors, (2641), 2172 states have internal predecessors, (2641), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:40:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4053 transitions. [2022-07-14 04:40:39,417 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4053 transitions. Word has length 144 [2022-07-14 04:40:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:39,418 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4053 transitions. [2022-07-14 04:40:39,418 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:40:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4053 transitions. [2022-07-14 04:40:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-14 04:40:39,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:39,420 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:40:39,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:40:39,421 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:40:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1181738883, now seen corresponding path program 1 times [2022-07-14 04:40:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:39,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825858334] [2022-07-14 04:40:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,581 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:39,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825858334] [2022-07-14 04:40:39,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825858334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:39,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:39,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058598921] [2022-07-14 04:40:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:39,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:39,584 INFO L87 Difference]: Start difference. First operand 3008 states and 4053 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:40:41,605 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:43,629 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:48,036 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:40:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:48,535 INFO L93 Difference]: Finished difference Result 3008 states and 4053 transitions. [2022-07-14 04:40:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:48,535 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:40:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:48,543 INFO L225 Difference]: With dead ends: 3008 [2022-07-14 04:40:48,544 INFO L226 Difference]: Without dead ends: 3006 [2022-07-14 04:40:48,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 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:48,545 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 2179 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:48,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2797 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1330 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2022-07-14 04:40:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-14 04:40:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 3006. [2022-07-14 04:40:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2113 states have (on average 1.2484619025082822) internal successors, (2638), 2170 states have internal predecessors, (2638), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:40:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4050 transitions. [2022-07-14 04:40:48,719 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4050 transitions. Word has length 150 [2022-07-14 04:40:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:48,720 INFO L495 AbstractCegarLoop]: Abstraction has 3006 states and 4050 transitions. [2022-07-14 04:40:48,720 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:40:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4050 transitions. [2022-07-14 04:40:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 04:40:48,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:48,725 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:40:48,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:40:48,725 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 25 more)] === [2022-07-14 04:40:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1422462914, now seen corresponding path program 1 times [2022-07-14 04:40:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:48,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137775772] [2022-07-14 04:40:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:40:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:48,905 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:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137775772] [2022-07-14 04:40:48,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137775772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:48,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:48,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221515045] [2022-07-14 04:40:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:48,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:48,906 INFO L87 Difference]: Start difference. First operand 3006 states and 4050 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:40:50,930 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:52,957 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:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:55,739 INFO L93 Difference]: Finished difference Result 3006 states and 4050 transitions. [2022-07-14 04:40:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:55,739 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:40:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:55,746 INFO L225 Difference]: With dead ends: 3006 [2022-07-14 04:40:55,746 INFO L226 Difference]: Without dead ends: 3004 [2022-07-14 04:40:55,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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:55,747 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 2173 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:55,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2795 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1329 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 04:40:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-07-14 04:40:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2022-07-14 04:40:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2112 states have (on average 1.2476325757575757) internal successors, (2635), 2168 states have internal predecessors, (2635), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:40:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 4047 transitions. [2022-07-14 04:40:55,870 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 4047 transitions. Word has length 156 [2022-07-14 04:40:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:55,870 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 4047 transitions. [2022-07-14 04:40:55,870 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:40:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4047 transitions. [2022-07-14 04:40:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 04:40:55,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:55,873 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:40:55,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:40:55,873 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 25 more)] === [2022-07-14 04:40:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash -274649241, now seen corresponding path program 1 times [2022-07-14 04:40:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031076015] [2022-07-14 04:40:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:40:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:40:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:40:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:40:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:40:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:40:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:40:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:40:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:40:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:40:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:40:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:40:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:40:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:40:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:40:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:40:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:40:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:40:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:40:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:56,086 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:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:56,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031076015] [2022-07-14 04:40:56,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031076015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:56,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668419525] [2022-07-14 04:40:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:56,089 INFO L87 Difference]: Start difference. First operand 3004 states and 4047 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:58,114 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:41:00,134 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:41:04,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:41:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:05,129 INFO L93 Difference]: Finished difference Result 3004 states and 4047 transitions. [2022-07-14 04:41:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:05,130 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:41:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:05,137 INFO L225 Difference]: With dead ends: 3004 [2022-07-14 04:41:05,137 INFO L226 Difference]: Without dead ends: 3002 [2022-07-14 04:41:05,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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:41:05,138 INFO L413 NwaCegarLoop]: 1381 mSDtfsCounter, 2167 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:05,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2793 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1326 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2022-07-14 04:41:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-07-14 04:41:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-07-14 04:41:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2111 states have (on average 1.2468024632875414) internal successors, (2632), 2166 states have internal predecessors, (2632), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:41:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4044 transitions. [2022-07-14 04:41:05,275 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4044 transitions. Word has length 162 [2022-07-14 04:41:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:05,276 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 4044 transitions. [2022-07-14 04:41:05,276 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:41:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4044 transitions. [2022-07-14 04:41:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 04:41:05,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:05,278 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:41:05,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:41:05,279 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 25 more)] === [2022-07-14 04:41:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -862924115, now seen corresponding path program 1 times [2022-07-14 04:41:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:05,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733700771] [2022-07-14 04:41:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:41:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:41:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:41:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:41:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:41:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:41:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:41:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:41:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:41:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:41:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:41:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:41:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:41:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:41:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:41:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:41:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:41:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:41:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:41:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:41:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:05,454 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:41:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:05,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733700771] [2022-07-14 04:41:05,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733700771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:05,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:05,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963284401] [2022-07-14 04:41:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:05,457 INFO L87 Difference]: Start difference. First operand 3002 states and 4044 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:41:07,483 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:41:09,507 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:41:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:12,260 INFO L93 Difference]: Finished difference Result 3002 states and 4044 transitions. [2022-07-14 04:41:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:12,261 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:41:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:12,268 INFO L225 Difference]: With dead ends: 3002 [2022-07-14 04:41:12,268 INFO L226 Difference]: Without dead ends: 3000 [2022-07-14 04:41:12,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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:41:12,269 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 2161 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:12,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2791 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:41:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-14 04:41:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 3000. [2022-07-14 04:41:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 2110 states have (on average 1.2459715639810427) internal successors, (2629), 2164 states have internal predecessors, (2629), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:41:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4041 transitions. [2022-07-14 04:41:12,396 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4041 transitions. Word has length 168 [2022-07-14 04:41:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:12,397 INFO L495 AbstractCegarLoop]: Abstraction has 3000 states and 4041 transitions. [2022-07-14 04:41:12,397 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:41:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4041 transitions. [2022-07-14 04:41:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 04:41:12,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:12,400 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:41:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:41:12,400 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 25 more)] === [2022-07-14 04:41:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1586344965, now seen corresponding path program 1 times [2022-07-14 04:41:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807156536] [2022-07-14 04:41:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:41:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:41:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:41:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:41:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:41:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:41:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:41:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:41:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:41:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:41:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:41:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:41:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:41:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:41:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:41:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:41:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:41:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:41:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:41:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:41:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:41:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:12,574 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:41:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:12,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807156536] [2022-07-14 04:41:12,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807156536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:12,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:12,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803096344] [2022-07-14 04:41:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:12,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:12,575 INFO L87 Difference]: Start difference. First operand 3000 states and 4041 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:41:14,597 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:41:16,631 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:41:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:19,413 INFO L93 Difference]: Finished difference Result 3000 states and 4041 transitions. [2022-07-14 04:41:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:19,414 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:41:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:19,420 INFO L225 Difference]: With dead ends: 3000 [2022-07-14 04:41:19,420 INFO L226 Difference]: Without dead ends: 2998 [2022-07-14 04:41:19,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 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:41:19,423 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2155 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:19,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2789 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1323 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 04:41:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-14 04:41:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2022-07-14 04:41:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2109 states have (on average 1.245139876718824) internal successors, (2626), 2162 states have internal predecessors, (2626), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-14 04:41:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4038 transitions. [2022-07-14 04:41:19,559 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4038 transitions. Word has length 174 [2022-07-14 04:41:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:19,560 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 4038 transitions. [2022-07-14 04:41:19,560 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:41:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4038 transitions. [2022-07-14 04:41:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 04:41:19,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:19,563 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:41:19,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:41:19,563 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 25 more)] === [2022-07-14 04:41:19,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 870548665, now seen corresponding path program 1 times [2022-07-14 04:41:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:19,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564218193] [2022-07-14 04:41:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:41:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:41:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:41:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:41:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:41:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:41:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:41:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:41:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:41:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:41:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:41:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:41:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:41:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:41:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:41:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:41:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:41:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:41:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:41:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:41:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:41:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-14 04:41:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:19,752 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:41:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:19,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564218193] [2022-07-14 04:41:19,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564218193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:19,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:19,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907477432] [2022-07-14 04:41:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:19,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:19,754 INFO L87 Difference]: Start difference. First operand 2998 states and 4038 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:41:21,776 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:41:23,799 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:41:27,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-14 04:41:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:28,677 INFO L93 Difference]: Finished difference Result 2998 states and 4038 transitions. [2022-07-14 04:41:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:28,678 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:41:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:28,686 INFO L225 Difference]: With dead ends: 2998 [2022-07-14 04:41:28,686 INFO L226 Difference]: Without dead ends: 2715 [2022-07-14 04:41:28,689 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:41:28,689 INFO L413 NwaCegarLoop]: 1376 mSDtfsCounter, 2146 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:28,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2788 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1322 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-07-14 04:41:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-07-14 04:41:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2712. [2022-07-14 04:41:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 1925 states have (on average 1.2654545454545454) internal successors, (2436), 1974 states have internal predecessors, (2436), 634 states have call successors, (634), 147 states have call predecessors, (634), 148 states have return successors, (656), 627 states have call predecessors, (656), 632 states have call successors, (656) [2022-07-14 04:41:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3726 transitions. [2022-07-14 04:41:28,861 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3726 transitions. Word has length 180 [2022-07-14 04:41:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:28,861 INFO L495 AbstractCegarLoop]: Abstraction has 2712 states and 3726 transitions. [2022-07-14 04:41:28,862 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:41:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3726 transitions. [2022-07-14 04:41:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-14 04:41:28,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:28,864 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-14 04:41:28,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:41:28,865 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting elants_i2c_calibrateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:41:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -200628028, now seen corresponding path program 1 times [2022-07-14 04:41:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:28,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296231504] [2022-07-14 04:41:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:41:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:41:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:41:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:41:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:41:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:41:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:41:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:41:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:41:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:41:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:41:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:41:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:41:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:41:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:41:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:41:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:41:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-14 04:41:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-14 04:41:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-07-14 04:41:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296231504] [2022-07-14 04:41:30,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296231504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:41:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995462026] [2022-07-14 04:41:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:30,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:41:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:41:30,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:41:30,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 04:41:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 04:41:30,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:41:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 167 proven. 3 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-07-14 04:41:31,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:41:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-07-14 04:41:31,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995462026] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:41:31,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:41:31,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 24 [2022-07-14 04:41:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765843163] [2022-07-14 04:41:31,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:41:31,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 04:41:31,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 04:41:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2022-07-14 04:41:31,471 INFO L87 Difference]: Start difference. First operand 2712 states and 3726 transitions. Second operand has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 18 states have internal predecessors, (123), 7 states have call successors, (57), 6 states have call predecessors, (57), 5 states have return successors, (49), 8 states have call predecessors, (49), 7 states have call successors, (49) [2022-07-14 04:41:33,492 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:41:35,518 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:41:37,549 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:41:39,580 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 []