./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:12:11,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:12:11,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:12:11,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:12:11,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:12:11,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:12:11,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:12:11,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:12:11,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:12:11,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:12:11,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:12:11,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:12:11,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:12:11,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:12:11,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:12:11,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:12:11,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:12:11,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:12:11,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:12:11,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:12:11,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:12:11,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:12:11,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:12:11,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:12:11,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:12:11,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:12:11,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:12:11,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:12:11,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:12:11,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:12:11,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:12:11,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:12:11,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:12:11,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:12:11,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:12:11,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:12:11,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:12:11,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:12:11,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:12:11,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:12:11,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:12:11,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:12:11,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:12:11,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:12:11,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:12:11,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:12:11,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:12:11,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:12:11,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:12:11,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:12:11,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:12:11,603 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:12:11,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:12:11,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:12:11,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:12:11,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:12:11,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:12:11,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:12:11,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:12:11,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:12:11,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:12:11,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:12:11,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:12:11,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:12:11,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:12:11,607 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:12:11,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:12:11,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:12:11,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 [2022-07-23 04:12:11,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:12:11,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:12:11,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:12:11,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:12:11,842 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:12:11,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-23 04:12:11,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714f1b8ce/1cb3cefd4c5d442ab53798580acc7eae/FLAG0a04ce05e [2022-07-23 04:12:12,616 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:12:12,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-23 04:12:12,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714f1b8ce/1cb3cefd4c5d442ab53798580acc7eae/FLAG0a04ce05e [2022-07-23 04:12:12,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714f1b8ce/1cb3cefd4c5d442ab53798580acc7eae [2022-07-23 04:12:12,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:12:12,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:12:12,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:12:12,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:12:12,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:12:12,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:12:12" (1/1) ... [2022-07-23 04:12:12,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386b2116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:12, skipping insertion in model container [2022-07-23 04:12:12,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:12:12" (1/1) ... [2022-07-23 04:12:12,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:12:12,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:12:15,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-23 04:12:15,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-23 04:12:15,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-23 04:12:15,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-23 04:12:15,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-23 04:12:15,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-23 04:12:15,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-23 04:12:15,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-23 04:12:15,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-23 04:12:15,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-23 04:12:15,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-23 04:12:15,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-23 04:12:15,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-23 04:12:15,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-23 04:12:15,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-23 04:12:15,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-23 04:12:15,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-23 04:12:15,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-23 04:12:15,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-23 04:12:15,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-23 04:12:15,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-23 04:12:15,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-23 04:12:15,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-23 04:12:15,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-23 04:12:15,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-23 04:12:15,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-23 04:12:15,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-23 04:12:15,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-23 04:12:15,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-23 04:12:15,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-23 04:12:15,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-23 04:12:15,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-23 04:12:15,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-23 04:12:15,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-23 04:12:15,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-23 04:12:15,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-23 04:12:15,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-23 04:12:15,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-23 04:12:15,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-23 04:12:15,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-23 04:12:15,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-23 04:12:15,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-23 04:12:15,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-23 04:12:15,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-23 04:12:15,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-23 04:12:15,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-23 04:12:15,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-23 04:12:15,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-23 04:12:15,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-23 04:12:15,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-23 04:12:15,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-23 04:12:15,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-23 04:12:15,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-23 04:12:15,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-23 04:12:15,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-23 04:12:15,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-23 04:12:15,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-23 04:12:15,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-23 04:12:15,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-23 04:12:15,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-23 04:12:15,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-23 04:12:15,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-23 04:12:15,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-23 04:12:15,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-23 04:12:15,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-23 04:12:15,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-23 04:12:15,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-23 04:12:15,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-23 04:12:15,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-23 04:12:15,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-23 04:12:15,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-23 04:12:15,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-23 04:12:15,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-23 04:12:15,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-23 04:12:15,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-23 04:12:15,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-23 04:12:15,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-23 04:12:15,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-23 04:12:15,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-23 04:12:15,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-23 04:12:15,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-23 04:12:15,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-23 04:12:15,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-23 04:12:15,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-23 04:12:15,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-23 04:12:15,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-23 04:12:15,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-23 04:12:15,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-23 04:12:15,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:12:15,431 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:12:15,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-23 04:12:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-23 04:12:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-23 04:12:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-23 04:12:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-23 04:12:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-23 04:12:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-23 04:12:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-23 04:12:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-23 04:12:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-23 04:12:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-23 04:12:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-23 04:12:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-23 04:12:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-23 04:12:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-23 04:12:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-23 04:12:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-23 04:12:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-23 04:12:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-23 04:12:15,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-23 04:12:15,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-23 04:12:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-23 04:12:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-23 04:12:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-23 04:12:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-23 04:12:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-23 04:12:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-23 04:12:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-23 04:12:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-23 04:12:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-23 04:12:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-23 04:12:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-23 04:12:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-23 04:12:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-23 04:12:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-23 04:12:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-23 04:12:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-23 04:12:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-23 04:12:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-23 04:12:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-23 04:12:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-23 04:12:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-23 04:12:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-23 04:12:15,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-23 04:12:15,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-23 04:12:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-23 04:12:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-23 04:12:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-23 04:12:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-23 04:12:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-23 04:12:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-23 04:12:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-23 04:12:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-23 04:12:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-23 04:12:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-23 04:12:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-23 04:12:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-23 04:12:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-23 04:12:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-23 04:12:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-23 04:12:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-23 04:12:15,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-23 04:12:15,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-23 04:12:15,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-23 04:12:15,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-23 04:12:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-23 04:12:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-23 04:12:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-23 04:12:15,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-23 04:12:15,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-23 04:12:15,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-23 04:12:15,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-23 04:12:15,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-23 04:12:15,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-23 04:12:15,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-23 04:12:15,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-23 04:12:15,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-23 04:12:15,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-23 04:12:15,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-23 04:12:15,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-23 04:12:15,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-23 04:12:15,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-23 04:12:15,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-23 04:12:15,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-23 04:12:15,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-23 04:12:15,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-23 04:12:15,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-23 04:12:15,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-23 04:12:15,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:12:15,793 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:12:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15 WrapperNode [2022-07-23 04:12:15,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:12:15,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:12:15,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:12:15,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:12:15,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:15,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,063 INFO L137 Inliner]: procedures = 591, calls = 1808, calls flagged for inlining = 314, calls inlined = 232, statements flattened = 4571 [2022-07-23 04:12:16,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:12:16,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:12:16,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:12:16,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:12:16,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:12:16,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:12:16,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:12:16,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:12:16,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (1/1) ... [2022-07-23 04:12:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:12:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:12:16,327 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-23 04:12:16,381 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-23 04:12:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:12:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:12:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:12:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:12:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:12:16,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:12:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:12:16,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:12:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:12:16,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:12:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_unregister [2022-07-23 04:12:16,405 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_unregister [2022-07-23 04:12:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:12:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:12:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:12:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:12:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_get_drvdata [2022-07-23 04:12:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_get_drvdata [2022-07-23 04:12:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:12:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:12:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:12:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_poll [2022-07-23 04:12:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_poll [2022-07-23 04:12:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_put_noidle [2022-07-23 04:12:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_put_noidle [2022-07-23 04:12:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:12:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:12:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 04:12:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 04:12:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:12:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:12:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:12:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:12:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:12:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:12:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:12:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:12:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-23 04:12:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-23 04:12:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:12:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:12:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-23 04:12:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-23 04:12:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_resume [2022-07-23 04:12:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_resume [2022-07-23 04:12:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure iio_priv [2022-07-23 04:12:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_priv [2022-07-23 04:12:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:12:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:12:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:12:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:12:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:12:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_acc_reg [2022-07-23 04:12:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_acc_reg [2022-07-23 04:12:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_mode [2022-07-23 04:12:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_mode [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:12:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:12:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:12:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:12:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure iio_push_event [2022-07-23 04:12:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_push_event [2022-07-23 04:12:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:12:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:12:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-23 04:12:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-23 04:12:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-23 04:12:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-23 04:12:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:12:16,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:12:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2022-07-23 04:12:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_trig_try_reen [2022-07-23 04:12:16,415 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_trig_try_reen [2022-07-23 04:12:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:12:16,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:12:16,416 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_remove [2022-07-23 04:12:16,416 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_remove [2022-07-23 04:12:16,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-23 04:12:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-23 04:12:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_range [2022-07-23 04:12:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_range [2022-07-23 04:12:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:12:16,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:12:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:12:16,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:12:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:12:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_register [2022-07-23 04:12:16,421 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_register [2022-07-23 04:12:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:12:16,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:12:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-23 04:12:16,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_read_byte_data [2022-07-23 04:12:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_read_byte_data [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure iio_triggered_buffer_cleanup [2022-07-23 04:12:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_triggered_buffer_cleanup [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_suspend [2022-07-23 04:12:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_suspend [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-23 04:12:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-23 04:12:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:12:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:12:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:12:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_power_state [2022-07-23 04:12:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_power_state [2022-07-23 04:12:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:12:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:12:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_set_drvdata [2022-07-23 04:12:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_set_drvdata [2022-07-23 04:12:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_register [2022-07-23 04:12:16,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_register [2022-07-23 04:12:16,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:12:16,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:12:16,424 INFO L130 BoogieDeclarations]: Found specification of procedure __pm_runtime_set_status [2022-07-23 04:12:16,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __pm_runtime_set_status [2022-07-23 04:12:16,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:12:16,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:12:16,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:12:16,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:12:16,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_unregister [2022-07-23 04:12:16,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_unregister [2022-07-23 04:12:16,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:12:16,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:12:16,425 INFO L130 BoogieDeclarations]: Found specification of procedure iio_device_unregister [2022-07-23 04:12:16,426 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_device_unregister [2022-07-23 04:12:16,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:12:16,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:12:16,426 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-23 04:12:16,426 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-23 04:12:16,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_triggered_buffer_cleanup [2022-07-23 04:12:16,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_triggered_buffer_cleanup [2022-07-23 04:12:16,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:12:16,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:12:16,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:12:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:12:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:12:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:12:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:12:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_mode [2022-07-23 04:12:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_mode [2022-07-23 04:12:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_resume [2022-07-23 04:12:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_resume [2022-07-23 04:12:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:12:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:12:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:12:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:12:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_suspend [2022-07-23 04:12:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_suspend [2022-07-23 04:12:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:12:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_write_byte_data [2022-07-23 04:12:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_write_byte_data [2022-07-23 04:12:17,069 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:12:17,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:12:17,180 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:12:30,153 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:12:30,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:12:30,172 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 04:12:30,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:12:30 BoogieIcfgContainer [2022-07-23 04:12:30,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:12:30,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:12:30,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:12:30,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:12:30,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:12:12" (1/3) ... [2022-07-23 04:12:30,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4099314d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:12:30, skipping insertion in model container [2022-07-23 04:12:30,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:12:15" (2/3) ... [2022-07-23 04:12:30,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4099314d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:12:30, skipping insertion in model container [2022-07-23 04:12:30,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:12:30" (3/3) ... [2022-07-23 04:12:30,183 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-23 04:12:30,194 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:12:30,195 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-07-23 04:12:30,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:12:30,310 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@35d9a045, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23c5748b [2022-07-23 04:12:30,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-07-23 04:12:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2022-07-23 04:12:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:12:30,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:30,330 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-23 04:12:30,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:12:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -727309348, now seen corresponding path program 1 times [2022-07-23 04:12:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:30,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904419174] [2022-07-23 04:12:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:30,992 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-23 04:12:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904419174] [2022-07-23 04:12:30,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904419174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:30,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:30,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881952667] [2022-07-23 04:12:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:31,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:31,030 INFO L87 Difference]: Start difference. First operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:12:33,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:35,124 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-23 04:12:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:37,789 INFO L93 Difference]: Finished difference Result 2884 states and 4163 transitions. [2022-07-23 04:12:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:37,794 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-23 04:12:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:37,822 INFO L225 Difference]: With dead ends: 2884 [2022-07-23 04:12:37,823 INFO L226 Difference]: Without dead ends: 1436 [2022-07-23 04:12:37,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:12:37,840 INFO L413 NwaCegarLoop]: 1815 mSDtfsCounter, 2973 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 1235 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3160 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1235 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:37,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3160 Valid, 3587 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1235 Valid, 1765 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-23 04:12:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-07-23 04:12:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2022-07-23 04:12:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1008 states have (on average 1.2599206349206349) internal successors, (1270), 1048 states have internal predecessors, (1270), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:12:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1936 transitions. [2022-07-23 04:12:37,962 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1936 transitions. Word has length 64 [2022-07-23 04:12:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:37,963 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1936 transitions. [2022-07-23 04:12:37,964 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-23 04:12:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1936 transitions. [2022-07-23 04:12:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:12:37,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:37,966 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-23 04:12:37,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:12:37,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:12:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1915016473, now seen corresponding path program 1 times [2022-07-23 04:12:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:37,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127175911] [2022-07-23 04:12:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:38,325 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-23 04:12:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127175911] [2022-07-23 04:12:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127175911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:38,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:38,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707592401] [2022-07-23 04:12:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:38,328 INFO L87 Difference]: Start difference. First operand 1436 states and 1936 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:12:40,358 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-23 04:12:42,368 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-23 04:12:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:44,673 INFO L93 Difference]: Finished difference Result 1436 states and 1936 transitions. [2022-07-23 04:12:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:44,673 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-23 04:12:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:44,680 INFO L225 Difference]: With dead ends: 1436 [2022-07-23 04:12:44,680 INFO L226 Difference]: Without dead ends: 1434 [2022-07-23 04:12:44,681 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-23 04:12:44,681 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 2936 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3120 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:44,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3120 Valid, 3545 Invalid, 2973 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1222 Valid, 1749 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:12:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-07-23 04:12:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2022-07-23 04:12:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1007 states have (on average 1.259185700099305) internal successors, (1268), 1046 states have internal predecessors, (1268), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:12:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1934 transitions. [2022-07-23 04:12:44,726 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1934 transitions. Word has length 70 [2022-07-23 04:12:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:44,727 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1934 transitions. [2022-07-23 04:12:44,727 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-23 04:12:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1934 transitions. [2022-07-23 04:12:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:12:44,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:44,733 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-23 04:12:44,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:12:44,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:12:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 154427305, now seen corresponding path program 1 times [2022-07-23 04:12:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:44,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367640518] [2022-07-23 04:12:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:44,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:45,043 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-23 04:12:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367640518] [2022-07-23 04:12:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367640518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:45,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880325910] [2022-07-23 04:12:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:45,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:45,045 INFO L87 Difference]: Start difference. First operand 1434 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:12:47,071 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-23 04:12:49,087 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-23 04:12:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:51,245 INFO L93 Difference]: Finished difference Result 1434 states and 1934 transitions. [2022-07-23 04:12:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:51,246 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-23 04:12:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:51,253 INFO L225 Difference]: With dead ends: 1434 [2022-07-23 04:12:51,253 INFO L226 Difference]: Without dead ends: 1432 [2022-07-23 04:12:51,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:12:51,255 INFO L413 NwaCegarLoop]: 1791 mSDtfsCounter, 2930 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:51,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3543 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1747 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:12:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-23 04:12:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2022-07-23 04:12:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1006 states have (on average 1.2584493041749503) internal successors, (1266), 1044 states have internal predecessors, (1266), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:12:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1932 transitions. [2022-07-23 04:12:51,306 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1932 transitions. Word has length 76 [2022-07-23 04:12:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:51,307 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1932 transitions. [2022-07-23 04:12:51,307 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-23 04:12:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1932 transitions. [2022-07-23 04:12:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:12:51,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:51,309 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:51,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:12:51,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:12:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 400513827, now seen corresponding path program 1 times [2022-07-23 04:12:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:51,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960962918] [2022-07-23 04:12:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:51,637 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-23 04:12:51,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960962918] [2022-07-23 04:12:51,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960962918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:51,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:51,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977197827] [2022-07-23 04:12:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:51,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:51,639 INFO L87 Difference]: Start difference. First operand 1432 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:12:53,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:55,709 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-23 04:12:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:58,307 INFO L93 Difference]: Finished difference Result 1432 states and 1932 transitions. [2022-07-23 04:12:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:58,307 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-23 04:12:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:58,324 INFO L225 Difference]: With dead ends: 1432 [2022-07-23 04:12:58,334 INFO L226 Difference]: Without dead ends: 1430 [2022-07-23 04:12:58,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:12:58,335 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 2924 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:58,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 3541 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1745 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-23 04:12:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-07-23 04:12:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2022-07-23 04:12:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1005 states have (on average 1.2577114427860696) internal successors, (1264), 1042 states have internal predecessors, (1264), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:12:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1930 transitions. [2022-07-23 04:12:58,400 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1930 transitions. Word has length 82 [2022-07-23 04:12:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:58,401 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1930 transitions. [2022-07-23 04:12:58,401 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-23 04:12:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1930 transitions. [2022-07-23 04:12:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:12:58,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:58,403 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-23 04:12:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:12:58,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:12:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1771881735, now seen corresponding path program 1 times [2022-07-23 04:12:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:58,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942780760] [2022-07-23 04:12:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:58,762 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-23 04:12:58,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942780760] [2022-07-23 04:12:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942780760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:58,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:58,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916111905] [2022-07-23 04:12:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:58,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:58,765 INFO L87 Difference]: Start difference. First operand 1430 states and 1930 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:13:00,800 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-23 04:13:02,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:04,890 INFO L93 Difference]: Finished difference Result 1430 states and 1930 transitions. [2022-07-23 04:13:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:04,890 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-23 04:13:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:04,896 INFO L225 Difference]: With dead ends: 1430 [2022-07-23 04:13:04,896 INFO L226 Difference]: Without dead ends: 1428 [2022-07-23 04:13:04,897 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-23 04:13:04,898 INFO L413 NwaCegarLoop]: 1787 mSDtfsCounter, 2918 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3539 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1743 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 04:13:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2022-07-23 04:13:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2022-07-23 04:13:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1004 states have (on average 1.2569721115537849) internal successors, (1262), 1040 states have internal predecessors, (1262), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1928 transitions. [2022-07-23 04:13:04,954 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1928 transitions. Word has length 88 [2022-07-23 04:13:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:04,956 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 1928 transitions. [2022-07-23 04:13:04,956 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-23 04:13:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1928 transitions. [2022-07-23 04:13:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:13:04,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:04,961 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-23 04:13:04,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:13:04,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 408227580, now seen corresponding path program 1 times [2022-07-23 04:13:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:04,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160121025] [2022-07-23 04:13:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:05,198 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-23 04:13:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160121025] [2022-07-23 04:13:05,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160121025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:05,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:05,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308649396] [2022-07-23 04:13:05,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:05,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:05,200 INFO L87 Difference]: Start difference. First operand 1428 states and 1928 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:13:07,225 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-23 04:13:09,241 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-23 04:13:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:11,720 INFO L93 Difference]: Finished difference Result 1428 states and 1928 transitions. [2022-07-23 04:13:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:11,720 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-23 04:13:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:11,726 INFO L225 Difference]: With dead ends: 1428 [2022-07-23 04:13:11,726 INFO L226 Difference]: Without dead ends: 1426 [2022-07-23 04:13:11,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:13:11,727 INFO L413 NwaCegarLoop]: 1785 mSDtfsCounter, 2912 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3092 Valid, 3537 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1741 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-23 04:13:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-07-23 04:13:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-07-23 04:13:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1003 states have (on average 1.2562313060817547) internal successors, (1260), 1038 states have internal predecessors, (1260), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1926 transitions. [2022-07-23 04:13:11,765 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1926 transitions. Word has length 94 [2022-07-23 04:13:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:11,765 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 1926 transitions. [2022-07-23 04:13:11,765 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-23 04:13:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1926 transitions. [2022-07-23 04:13:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:13:11,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:11,766 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-23 04:13:11,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:13:11,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:11,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1237999984, now seen corresponding path program 1 times [2022-07-23 04:13:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105608500] [2022-07-23 04:13:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:13:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:12,019 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-23 04:13:12,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105608500] [2022-07-23 04:13:12,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105608500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:12,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:12,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506271485] [2022-07-23 04:13:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:12,021 INFO L87 Difference]: Start difference. First operand 1426 states and 1926 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:13:14,048 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-23 04:13:16,061 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-23 04:13:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:18,912 INFO L93 Difference]: Finished difference Result 1426 states and 1926 transitions. [2022-07-23 04:13:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:18,913 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-23 04:13:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:18,920 INFO L225 Difference]: With dead ends: 1426 [2022-07-23 04:13:18,920 INFO L226 Difference]: Without dead ends: 1424 [2022-07-23 04:13:18,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:13:18,923 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 2906 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3085 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:18,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3085 Valid, 3535 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1739 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:13:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-07-23 04:13:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2022-07-23 04:13:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1002 states have (on average 1.255489021956088) internal successors, (1258), 1036 states have internal predecessors, (1258), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1924 transitions. [2022-07-23 04:13:18,977 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1924 transitions. Word has length 100 [2022-07-23 04:13:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:18,977 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 1924 transitions. [2022-07-23 04:13:18,978 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-23 04:13:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1924 transitions. [2022-07-23 04:13:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:13:18,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:18,980 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-23 04:13:18,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:13:18,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1395575479, now seen corresponding path program 1 times [2022-07-23 04:13:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:18,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352718715] [2022-07-23 04:13:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:13:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:13:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:19,368 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-23 04:13:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352718715] [2022-07-23 04:13:19,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352718715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:19,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:19,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913707209] [2022-07-23 04:13:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:19,371 INFO L87 Difference]: Start difference. First operand 1424 states and 1924 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:13:21,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:23,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:26,992 INFO L93 Difference]: Finished difference Result 1424 states and 1924 transitions. [2022-07-23 04:13:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:26,992 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-23 04:13:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:26,998 INFO L225 Difference]: With dead ends: 1424 [2022-07-23 04:13:26,998 INFO L226 Difference]: Without dead ends: 1422 [2022-07-23 04:13:26,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:13:27,000 INFO L413 NwaCegarLoop]: 1781 mSDtfsCounter, 2904 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3082 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:27,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3082 Valid, 3533 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1733 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-23 04:13:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-07-23 04:13:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2022-07-23 04:13:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1001 states have (on average 1.2547452547452547) internal successors, (1256), 1034 states have internal predecessors, (1256), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1922 transitions. [2022-07-23 04:13:27,058 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1922 transitions. Word has length 106 [2022-07-23 04:13:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:27,059 INFO L495 AbstractCegarLoop]: Abstraction has 1422 states and 1922 transitions. [2022-07-23 04:13:27,059 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-23 04:13:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1922 transitions. [2022-07-23 04:13:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:13:27,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:27,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:13:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:13:27,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1118375354, now seen corresponding path program 1 times [2022-07-23 04:13:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589306158] [2022-07-23 04:13:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:13:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:13:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:27,299 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-23 04:13:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589306158] [2022-07-23 04:13:27,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589306158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:27,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:27,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215392789] [2022-07-23 04:13:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:27,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:27,302 INFO L87 Difference]: Start difference. First operand 1422 states and 1922 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:13:29,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:31,365 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-23 04:13:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:33,604 INFO L93 Difference]: Finished difference Result 1422 states and 1922 transitions. [2022-07-23 04:13:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:33,605 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-23 04:13:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:33,609 INFO L225 Difference]: With dead ends: 1422 [2022-07-23 04:13:33,609 INFO L226 Difference]: Without dead ends: 1420 [2022-07-23 04:13:33,610 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-23 04:13:33,610 INFO L413 NwaCegarLoop]: 1779 mSDtfsCounter, 2892 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3070 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:33,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3070 Valid, 3531 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1735 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-23 04:13:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-23 04:13:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2022-07-23 04:13:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1000 states have (on average 1.254) internal successors, (1254), 1032 states have internal predecessors, (1254), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1920 transitions. [2022-07-23 04:13:33,653 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1920 transitions. Word has length 108 [2022-07-23 04:13:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 1920 transitions. [2022-07-23 04:13:33,653 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-23 04:13:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1920 transitions. [2022-07-23 04:13:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-23 04:13:33,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:33,655 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-23 04:13:33,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:13:33,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1557431567, now seen corresponding path program 1 times [2022-07-23 04:13:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547317524] [2022-07-23 04:13:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:13:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:13:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:13:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:13:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:13:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:13:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:13:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:13:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:13:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:13:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:33,899 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-23 04:13:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:33,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547317524] [2022-07-23 04:13:33,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547317524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:33,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:33,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991015784] [2022-07-23 04:13:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:33,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:33,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:33,901 INFO L87 Difference]: Start difference. First operand 1420 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:13:35,925 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-23 04:13:37,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:39,985 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-23 04:13:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:42,015 INFO L93 Difference]: Finished difference Result 2026 states and 2650 transitions. [2022-07-23 04:13:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:13:42,016 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-23 04:13:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:42,022 INFO L225 Difference]: With dead ends: 2026 [2022-07-23 04:13:42,022 INFO L226 Difference]: Without dead ends: 1420 [2022-07-23 04:13:42,024 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-23 04:13:42,025 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 3266 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 1625 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3461 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:42,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3461 Valid, 3092 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 1393 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-07-23 04:13:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-23 04:13:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1416. [2022-07-23 04:13:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 997 states have (on average 1.2527582748244734) internal successors, (1249), 1028 states have internal predecessors, (1249), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 04:13:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1915 transitions. [2022-07-23 04:13:42,079 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1915 transitions. Word has length 129 [2022-07-23 04:13:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:42,080 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1915 transitions. [2022-07-23 04:13:42,085 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-23 04:13:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1915 transitions. [2022-07-23 04:13:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:13:42,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:42,087 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-23 04:13:42,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:13:42,088 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash 382673920, now seen corresponding path program 1 times [2022-07-23 04:13:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:42,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753789930] [2022-07-23 04:13:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:13:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:13:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:13:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:42,304 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-23 04:13:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:42,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753789930] [2022-07-23 04:13:42,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753789930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:42,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:42,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:42,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757970713] [2022-07-23 04:13:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:42,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:42,306 INFO L87 Difference]: Start difference. First operand 1416 states and 1915 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:13:44,337 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-23 04:13:46,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:51,588 INFO L93 Difference]: Finished difference Result 2811 states and 3799 transitions. [2022-07-23 04:13:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:13:51,588 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-23 04:13:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:51,613 INFO L225 Difference]: With dead ends: 2811 [2022-07-23 04:13:51,623 INFO L226 Difference]: Without dead ends: 2809 [2022-07-23 04:13:51,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:13:51,627 INFO L413 NwaCegarLoop]: 2522 mSDtfsCounter, 3566 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 4240 mSolverCounterSat, 1939 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 6181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 4240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:51,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 5171 Invalid, 6181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 4240 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2022-07-23 04:13:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-07-23 04:13:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2705. [2022-07-23 04:13:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 1923 states have (on average 1.2553302132085284) internal successors, (2414), 1970 states have internal predecessors, (2414), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-23 04:13:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3688 transitions. [2022-07-23 04:13:51,778 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3688 transitions. Word has length 114 [2022-07-23 04:13:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:51,781 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3688 transitions. [2022-07-23 04:13:51,783 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-23 04:13:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3688 transitions. [2022-07-23 04:13:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-23 04:13:51,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:51,786 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-23 04:13:51,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:13:51,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash 13417120, now seen corresponding path program 1 times [2022-07-23 04:13:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:51,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200353329] [2022-07-23 04:13:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:13:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:13:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:13:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:13:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:13:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:13:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:13:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:13:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:13:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:13:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:13:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,106 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-23 04:13:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200353329] [2022-07-23 04:13:52,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200353329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:13:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162393568] [2022-07-23 04:13:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:52,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:13:52,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:13:52,135 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-23 04:13:52,171 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-23 04:13:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:13:53,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:13:53,181 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-23 04:13:53,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:13:53,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162393568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:53,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:13:53,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-23 04:13:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719905964] [2022-07-23 04:13:53,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:53,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:13:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:13:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:13:53,183 INFO L87 Difference]: Start difference. First operand 2705 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:13:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:53,293 INFO L93 Difference]: Finished difference Result 3810 states and 5034 transitions. [2022-07-23 04:13:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:13:53,293 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-23 04:13:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:53,304 INFO L225 Difference]: With dead ends: 3810 [2022-07-23 04:13:53,304 INFO L226 Difference]: Without dead ends: 2699 [2022-07-23 04:13:53,308 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-23 04:13:53,309 INFO L413 NwaCegarLoop]: 1909 mSDtfsCounter, 1895 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:53,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1909 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:13:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-07-23 04:13:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699. [2022-07-23 04:13:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1918 states have (on average 1.253910323253389) internal successors, (2405), 1964 states have internal predecessors, (2405), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-23 04:13:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3679 transitions. [2022-07-23 04:13:53,464 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3679 transitions. Word has length 135 [2022-07-23 04:13:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:53,464 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3679 transitions. [2022-07-23 04:13:53,465 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-23 04:13:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3679 transitions. [2022-07-23 04:13:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:13:53,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:53,466 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-23 04:13:53,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 04:13:53,687 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-23 04:13:53,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:13:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1128396839, now seen corresponding path program 1 times [2022-07-23 04:13:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:53,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087664160] [2022-07-23 04:13:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:13:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:13:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:13:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:13:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:13:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:13:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:13:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:13:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:13:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:13:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:13:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:13:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:13:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:13:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:13:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,926 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-23 04:13:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087664160] [2022-07-23 04:13:53,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087664160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:53,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:53,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083810562] [2022-07-23 04:13:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:53,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:53,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:53,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:53,928 INFO L87 Difference]: Start difference. First operand 2699 states and 3679 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:13:55,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:13:57,974 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-23 04:14:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:00,437 INFO L93 Difference]: Finished difference Result 2699 states and 3679 transitions. [2022-07-23 04:14:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:00,438 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-23 04:14:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:00,446 INFO L225 Difference]: With dead ends: 2699 [2022-07-23 04:14:00,447 INFO L226 Difference]: Without dead ends: 2697 [2022-07-23 04:14:00,448 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-23 04:14:00,448 INFO L413 NwaCegarLoop]: 1767 mSDtfsCounter, 2878 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:00,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3491 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1731 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-23 04:14:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2022-07-23 04:14:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2697. [2022-07-23 04:14:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1917 states have (on average 1.2535211267605635) internal successors, (2403), 1962 states have internal predecessors, (2403), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-23 04:14:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3677 transitions. [2022-07-23 04:14:00,542 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3677 transitions. Word has length 120 [2022-07-23 04:14:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:00,543 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3677 transitions. [2022-07-23 04:14:00,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:14:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3677 transitions. [2022-07-23 04:14:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:14:00,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:00,545 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-23 04:14:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:14:00,545 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1109898579, now seen corresponding path program 1 times [2022-07-23 04:14:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727877863] [2022-07-23 04:14:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:14:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:14:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:14:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:00,825 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-23 04:14:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727877863] [2022-07-23 04:14:00,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727877863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:00,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:00,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923552909] [2022-07-23 04:14:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:00,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:00,828 INFO L87 Difference]: Start difference. First operand 2697 states and 3677 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:14:02,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:14:04,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:14:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:07,061 INFO L93 Difference]: Finished difference Result 2697 states and 3677 transitions. [2022-07-23 04:14:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:07,062 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-23 04:14:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:07,084 INFO L225 Difference]: With dead ends: 2697 [2022-07-23 04:14:07,085 INFO L226 Difference]: Without dead ends: 2695 [2022-07-23 04:14:07,086 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-23 04:14:07,086 INFO L413 NwaCegarLoop]: 1765 mSDtfsCounter, 2872 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:07,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3489 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1729 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 04:14:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-07-23 04:14:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2695. [2022-07-23 04:14:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 1916 states have (on average 1.2531315240083507) internal successors, (2401), 1960 states have internal predecessors, (2401), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-23 04:14:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3675 transitions. [2022-07-23 04:14:07,183 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3675 transitions. Word has length 126 [2022-07-23 04:14:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:07,184 INFO L495 AbstractCegarLoop]: Abstraction has 2695 states and 3675 transitions. [2022-07-23 04:14:07,184 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-23 04:14:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3675 transitions. [2022-07-23 04:14:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-23 04:14:07,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:07,186 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:14:07,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:14:07,186 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 138561349, now seen corresponding path program 1 times [2022-07-23 04:14:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:07,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554147775] [2022-07-23 04:14:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:14:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:14:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:14:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:14:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:14:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:14:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:14:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-23 04:14:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:07,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554147775] [2022-07-23 04:14:07,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554147775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:07,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:07,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:14:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19557540] [2022-07-23 04:14:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:14:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:14:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:14:07,649 INFO L87 Difference]: Start difference. First operand 2695 states and 3675 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:14:09,679 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-23 04:14:11,702 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-23 04:14:13,706 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-23 04:14:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:18,397 INFO L93 Difference]: Finished difference Result 2851 states and 3873 transitions. [2022-07-23 04:14:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:14:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2022-07-23 04:14:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:18,451 INFO L225 Difference]: With dead ends: 2851 [2022-07-23 04:14:18,451 INFO L226 Difference]: Without dead ends: 2849 [2022-07-23 04:14:18,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:14:18,456 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 3149 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 1574 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3297 SdHoareTripleChecker+Valid, 4701 SdHoareTripleChecker+Invalid, 5662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:18,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3297 Valid, 4701 Invalid, 5662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 4085 Invalid, 3 Unknown, 0 Unchecked, 10.4s Time] [2022-07-23 04:14:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2022-07-23 04:14:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2841. [2022-07-23 04:14:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2037 states have (on average 1.2547864506627393) internal successors, (2556), 2080 states have internal predecessors, (2556), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:14:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3854 transitions. [2022-07-23 04:14:18,567 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3854 transitions. Word has length 154 [2022-07-23 04:14:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:18,567 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 3854 transitions. [2022-07-23 04:14:18,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:14:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3854 transitions. [2022-07-23 04:14:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:14:18,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:18,573 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-23 04:14:18,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:14:18,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:18,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2002495305, now seen corresponding path program 1 times [2022-07-23 04:14:18,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:18,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332861808] [2022-07-23 04:14:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:14:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:14:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:14:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:14:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,840 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-23 04:14:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:18,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332861808] [2022-07-23 04:14:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332861808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:18,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488363424] [2022-07-23 04:14:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:18,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:18,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:18,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:18,843 INFO L87 Difference]: Start difference. First operand 2841 states and 3854 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:14:20,867 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-23 04:14:22,887 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-23 04:14:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:25,788 INFO L93 Difference]: Finished difference Result 2841 states and 3854 transitions. [2022-07-23 04:14:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:25,789 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-23 04:14:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:25,798 INFO L225 Difference]: With dead ends: 2841 [2022-07-23 04:14:25,798 INFO L226 Difference]: Without dead ends: 2839 [2022-07-23 04:14:25,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:14:25,800 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 2860 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:25,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3485 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1725 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:14:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2022-07-23 04:14:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2022-07-23 04:14:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2036 states have (on average 1.2544204322200392) internal successors, (2554), 2078 states have internal predecessors, (2554), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:14:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3852 transitions. [2022-07-23 04:14:25,919 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3852 transitions. Word has length 132 [2022-07-23 04:14:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:25,921 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3852 transitions. [2022-07-23 04:14:25,921 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-23 04:14:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3852 transitions. [2022-07-23 04:14:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:14:25,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:25,923 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-23 04:14:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:14:25,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 269312601, now seen corresponding path program 1 times [2022-07-23 04:14:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:25,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931829825] [2022-07-23 04:14:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:14:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:14:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:14:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:14:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:14:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,176 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-23 04:14:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:26,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931829825] [2022-07-23 04:14:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931829825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:26,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173457813] [2022-07-23 04:14:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:26,178 INFO L87 Difference]: Start difference. First operand 2839 states and 3852 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:14:28,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:14:30,294 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-23 04:14:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:32,530 INFO L93 Difference]: Finished difference Result 2839 states and 3852 transitions. [2022-07-23 04:14:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:32,531 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-23 04:14:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:32,538 INFO L225 Difference]: With dead ends: 2839 [2022-07-23 04:14:32,538 INFO L226 Difference]: Without dead ends: 2837 [2022-07-23 04:14:32,539 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-23 04:14:32,539 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 2854 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3027 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:32,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3027 Valid, 3483 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1723 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-23 04:14:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2022-07-23 04:14:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2837. [2022-07-23 04:14:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2035 states have (on average 1.2540540540540541) internal successors, (2552), 2076 states have internal predecessors, (2552), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:14:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 3850 transitions. [2022-07-23 04:14:32,633 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 3850 transitions. Word has length 138 [2022-07-23 04:14:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:32,633 INFO L495 AbstractCegarLoop]: Abstraction has 2837 states and 3850 transitions. [2022-07-23 04:14:32,633 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-23 04:14:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3850 transitions. [2022-07-23 04:14:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:14:32,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:32,635 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-23 04:14:32,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:14:32,635 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1054392417, now seen corresponding path program 1 times [2022-07-23 04:14:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:32,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619998504] [2022-07-23 04:14:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:14:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:14:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:14:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:14:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:14:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:14:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:32,862 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-23 04:14:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619998504] [2022-07-23 04:14:32,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619998504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:32,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:32,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060055367] [2022-07-23 04:14:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:32,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:32,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:32,866 INFO L87 Difference]: Start difference. First operand 2837 states and 3850 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:14:34,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:14:36,922 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-23 04:14:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:39,101 INFO L93 Difference]: Finished difference Result 2837 states and 3850 transitions. [2022-07-23 04:14:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:39,101 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-23 04:14:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:39,111 INFO L225 Difference]: With dead ends: 2837 [2022-07-23 04:14:39,111 INFO L226 Difference]: Without dead ends: 2835 [2022-07-23 04:14:39,113 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-23 04:14:39,113 INFO L413 NwaCegarLoop]: 1757 mSDtfsCounter, 2848 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:39,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 3481 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1721 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:14:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-23 04:14:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2022-07-23 04:14:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2034 states have (on average 1.2536873156342183) internal successors, (2550), 2074 states have internal predecessors, (2550), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:14:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3848 transitions. [2022-07-23 04:14:39,238 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3848 transitions. Word has length 144 [2022-07-23 04:14:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:39,238 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3848 transitions. [2022-07-23 04:14:39,239 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-23 04:14:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3848 transitions. [2022-07-23 04:14:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-23 04:14:39,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:39,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:14:39,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:14:39,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -603031875, now seen corresponding path program 1 times [2022-07-23 04:14:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:39,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168431706] [2022-07-23 04:14:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:14:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:14:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:14:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:14:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:14:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:14:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:14:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:14:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:14:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-23 04:14:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168431706] [2022-07-23 04:14:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168431706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:39,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:39,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:14:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132189346] [2022-07-23 04:14:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:39,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:14:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:14:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:14:39,655 INFO L87 Difference]: Start difference. First operand 2835 states and 3848 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:14:41,681 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-23 04:14:43,692 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-23 04:14:45,703 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-23 04:14:47,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:14:49,785 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-23 04:14:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:55,604 INFO L93 Difference]: Finished difference Result 3823 states and 5454 transitions. [2022-07-23 04:14:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 04:14:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 176 [2022-07-23 04:14:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:55,623 INFO L225 Difference]: With dead ends: 3823 [2022-07-23 04:14:55,623 INFO L226 Difference]: Without dead ends: 3821 [2022-07-23 04:14:55,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-07-23 04:14:55,627 INFO L413 NwaCegarLoop]: 1865 mSDtfsCounter, 4831 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 6647 mSolverCounterSat, 3322 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4838 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 9974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3322 IncrementalHoareTripleChecker+Valid, 6647 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:55,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4838 Valid, 6477 Invalid, 9974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3322 Valid, 6647 Invalid, 5 Unknown, 0 Unchecked, 15.4s Time] [2022-07-23 04:14:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-07-23 04:14:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2833. [2022-07-23 04:14:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2033 states have (on average 1.2528283325135268) internal successors, (2547), 2072 states have internal predecessors, (2547), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:14:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3845 transitions. [2022-07-23 04:14:55,773 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3845 transitions. Word has length 176 [2022-07-23 04:14:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:55,773 INFO L495 AbstractCegarLoop]: Abstraction has 2833 states and 3845 transitions. [2022-07-23 04:14:55,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:14:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3845 transitions. [2022-07-23 04:14:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:14:55,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:55,776 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-23 04:14:55,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:14:55,776 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:14:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1136288553, now seen corresponding path program 1 times [2022-07-23 04:14:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:55,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609193398] [2022-07-23 04:14:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:55,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:14:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:14:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:14:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:14:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:14:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:14:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:14:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:14:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:14:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:14:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:14:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:14:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,111 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-23 04:14:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:56,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609193398] [2022-07-23 04:14:56,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609193398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:56,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:56,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537503822] [2022-07-23 04:14:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:56,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:56,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:56,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:56,113 INFO L87 Difference]: Start difference. First operand 2833 states and 3845 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:14:58,140 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-23 04:15:00,150 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-23 04:15:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:02,770 INFO L93 Difference]: Finished difference Result 2833 states and 3845 transitions. [2022-07-23 04:15:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:02,770 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-23 04:15:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:02,779 INFO L225 Difference]: With dead ends: 2833 [2022-07-23 04:15:02,779 INFO L226 Difference]: Without dead ends: 2831 [2022-07-23 04:15:02,781 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-23 04:15:02,782 INFO L413 NwaCegarLoop]: 1753 mSDtfsCounter, 2836 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3007 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:02,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3007 Valid, 3477 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1717 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 04:15:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-07-23 04:15:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2831. [2022-07-23 04:15:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2032 states have (on average 1.25246062992126) internal successors, (2545), 2070 states have internal predecessors, (2545), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:15:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3843 transitions. [2022-07-23 04:15:02,929 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3843 transitions. Word has length 150 [2022-07-23 04:15:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:02,929 INFO L495 AbstractCegarLoop]: Abstraction has 2831 states and 3843 transitions. [2022-07-23 04:15:02,930 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-23 04:15:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3843 transitions. [2022-07-23 04:15:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:15:02,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:02,932 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-23 04:15:02,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:15:02,933 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1255467933, now seen corresponding path program 1 times [2022-07-23 04:15:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:02,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785152450] [2022-07-23 04:15:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:15:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:15:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:15:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:15:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:15:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:15:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:15:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:15:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:15:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:15:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:15:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:03,359 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-23 04:15:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785152450] [2022-07-23 04:15:03,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785152450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:03,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:03,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393532072] [2022-07-23 04:15:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:03,362 INFO L87 Difference]: Start difference. First operand 2831 states and 3843 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:15:05,387 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-23 04:15:07,406 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-23 04:15:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:09,402 INFO L93 Difference]: Finished difference Result 2831 states and 3843 transitions. [2022-07-23 04:15:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:09,403 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-23 04:15:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:09,410 INFO L225 Difference]: With dead ends: 2831 [2022-07-23 04:15:09,410 INFO L226 Difference]: Without dead ends: 2829 [2022-07-23 04:15:09,411 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-23 04:15:09,411 INFO L413 NwaCegarLoop]: 1751 mSDtfsCounter, 2830 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:09,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 3475 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1715 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-07-23 04:15:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-07-23 04:15:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2022-07-23 04:15:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2031 states have (on average 1.2520925652387986) internal successors, (2543), 2068 states have internal predecessors, (2543), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:15:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 3841 transitions. [2022-07-23 04:15:09,533 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 3841 transitions. Word has length 156 [2022-07-23 04:15:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:09,534 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 3841 transitions. [2022-07-23 04:15:09,534 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-23 04:15:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 3841 transitions. [2022-07-23 04:15:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 04:15:09,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:09,536 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-23 04:15:09,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:15:09,537 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:09,537 INFO L85 PathProgramCache]: Analyzing trace with hash 511816783, now seen corresponding path program 1 times [2022-07-23 04:15:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:09,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651602228] [2022-07-23 04:15:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:15:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:15:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:15:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:15:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:15:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:15:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:15:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:15:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:15:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:15:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:15:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:09,801 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-23 04:15:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:09,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651602228] [2022-07-23 04:15:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651602228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:09,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:09,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97167874] [2022-07-23 04:15:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:09,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:09,804 INFO L87 Difference]: Start difference. First operand 2829 states and 3841 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:15:11,829 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-23 04:15:13,834 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-23 04:15:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:16,082 INFO L93 Difference]: Finished difference Result 2829 states and 3841 transitions. [2022-07-23 04:15:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:16,082 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-23 04:15:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:16,111 INFO L225 Difference]: With dead ends: 2829 [2022-07-23 04:15:16,111 INFO L226 Difference]: Without dead ends: 2827 [2022-07-23 04:15:16,114 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-23 04:15:16,114 INFO L413 NwaCegarLoop]: 1749 mSDtfsCounter, 2824 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:16,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 3473 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1713 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:15:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-07-23 04:15:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2022-07-23 04:15:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2030 states have (on average 1.2517241379310344) internal successors, (2541), 2066 states have internal predecessors, (2541), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:15:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3839 transitions. [2022-07-23 04:15:16,247 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3839 transitions. Word has length 162 [2022-07-23 04:15:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:16,247 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 3839 transitions. [2022-07-23 04:15:16,247 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-23 04:15:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3839 transitions. [2022-07-23 04:15:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 04:15:16,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:16,250 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-23 04:15:16,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:15:16,250 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 391898802, now seen corresponding path program 1 times [2022-07-23 04:15:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746244003] [2022-07-23 04:15:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:15:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:15:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:15:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:15:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:15:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:15:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:15:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:15:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:15:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:15:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:15:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,584 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-23 04:15:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:16,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746244003] [2022-07-23 04:15:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746244003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:16,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:16,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892898390] [2022-07-23 04:15:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:16,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:16,586 INFO L87 Difference]: Start difference. First operand 2827 states and 3839 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 04:15:18,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:20,653 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-23 04:15:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:23,271 INFO L93 Difference]: Finished difference Result 2827 states and 3839 transitions. [2022-07-23 04:15:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:23,272 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-23 04:15:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:23,285 INFO L225 Difference]: With dead ends: 2827 [2022-07-23 04:15:23,285 INFO L226 Difference]: Without dead ends: 2825 [2022-07-23 04:15:23,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:15:23,292 INFO L413 NwaCegarLoop]: 1747 mSDtfsCounter, 2818 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:23,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2986 Valid, 3471 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1711 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 04:15:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2022-07-23 04:15:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2825. [2022-07-23 04:15:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2029 states have (on average 1.2513553474618038) internal successors, (2539), 2064 states have internal predecessors, (2539), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:15:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3837 transitions. [2022-07-23 04:15:23,500 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3837 transitions. Word has length 168 [2022-07-23 04:15:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:23,501 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3837 transitions. [2022-07-23 04:15:23,501 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-23 04:15:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3837 transitions. [2022-07-23 04:15:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-23 04:15:23,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:23,505 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-23 04:15:23,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:15:23,506 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1664617640, now seen corresponding path program 1 times [2022-07-23 04:15:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:23,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406293978] [2022-07-23 04:15:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:15:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:15:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:15:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:15:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:15:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:15:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:15:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:15:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:15:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:15:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:15:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:15:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,881 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-23 04:15:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:23,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406293978] [2022-07-23 04:15:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406293978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:23,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:23,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347863023] [2022-07-23 04:15:23,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:23,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:23,886 INFO L87 Difference]: Start difference. First operand 2825 states and 3837 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-23 04:15:25,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:27,967 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-23 04:15:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:30,923 INFO L93 Difference]: Finished difference Result 2825 states and 3837 transitions. [2022-07-23 04:15:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:30,924 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-23 04:15:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:30,932 INFO L225 Difference]: With dead ends: 2825 [2022-07-23 04:15:30,932 INFO L226 Difference]: Without dead ends: 2823 [2022-07-23 04:15:30,947 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-23 04:15:30,948 INFO L413 NwaCegarLoop]: 1745 mSDtfsCounter, 2812 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:30,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2979 Valid, 3469 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-23 04:15:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-07-23 04:15:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2022-07-23 04:15:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2028 states have (on average 1.2509861932938855) internal successors, (2537), 2062 states have internal predecessors, (2537), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-23 04:15:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3835 transitions. [2022-07-23 04:15:31,178 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3835 transitions. Word has length 174 [2022-07-23 04:15:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:31,178 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 3835 transitions. [2022-07-23 04:15:31,178 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-23 04:15:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3835 transitions. [2022-07-23 04:15:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-23 04:15:31,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:31,182 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-23 04:15:31,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:15:31,182 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 633874428, now seen corresponding path program 1 times [2022-07-23 04:15:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:31,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505288530] [2022-07-23 04:15:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:15:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:15:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:15:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:15:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:15:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:15:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:15:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:15:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:15:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:15:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:15:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:15:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:15:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:31,589 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-23 04:15:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505288530] [2022-07-23 04:15:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505288530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:31,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:31,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907510331] [2022-07-23 04:15:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:31,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:31,591 INFO L87 Difference]: Start difference. First operand 2823 states and 3835 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 04:15:33,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:35,664 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-23 04:15:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:37,910 INFO L93 Difference]: Finished difference Result 2823 states and 3835 transitions. [2022-07-23 04:15:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:37,911 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-23 04:15:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:37,920 INFO L225 Difference]: With dead ends: 2823 [2022-07-23 04:15:37,921 INFO L226 Difference]: Without dead ends: 2368 [2022-07-23 04:15:37,925 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-23 04:15:37,926 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2803 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2969 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:37,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2969 Valid, 3468 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:15:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-23 04:15:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-23 04:15:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1727 states have (on average 1.267515923566879) internal successors, (2189), 1754 states have internal predecessors, (2189), 525 states have call successors, (525), 115 states have call predecessors, (525), 114 states have return successors, (523), 519 states have call predecessors, (523), 523 states have call successors, (523) [2022-07-23 04:15:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3237 transitions. [2022-07-23 04:15:38,062 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3237 transitions. Word has length 180 [2022-07-23 04:15:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:38,062 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3237 transitions. [2022-07-23 04:15:38,062 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-23 04:15:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3237 transitions. [2022-07-23 04:15:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-23 04:15:38,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:38,069 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:15:38,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:15:38,070 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1967932840, now seen corresponding path program 1 times [2022-07-23 04:15:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:38,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272091884] [2022-07-23 04:15:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:15:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:15:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:15:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:15:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:15:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:15:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 04:15:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:15:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 04:15:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:15:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 04:15:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-23 04:15:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-23 04:15:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:15:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-23 04:15:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-23 04:15:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-23 04:15:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-23 04:15:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-23 04:15:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-23 04:15:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-23 04:15:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-23 04:15:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-23 04:15:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-23 04:15:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-23 04:15:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-23 04:15:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272091884] [2022-07-23 04:15:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272091884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:38,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:38,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:15:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887979424] [2022-07-23 04:15:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:15:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:15:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:15:38,780 INFO L87 Difference]: Start difference. First operand 2368 states and 3237 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:15:40,804 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-23 04:15:42,814 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-23 04:15:44,823 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-23 04:15:46,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:52,888 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-23 04:15:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:55,594 INFO L93 Difference]: Finished difference Result 6092 states and 8650 transitions. [2022-07-23 04:15:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 04:15:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 340 [2022-07-23 04:15:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:55,604 INFO L225 Difference]: With dead ends: 6092 [2022-07-23 04:15:55,604 INFO L226 Difference]: Without dead ends: 3743 [2022-07-23 04:15:55,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:15:55,610 INFO L413 NwaCegarLoop]: 2586 mSDtfsCounter, 2594 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 6761 mSolverCounterSat, 1615 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2862 SdHoareTripleChecker+Valid, 8216 SdHoareTripleChecker+Invalid, 8381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1615 IncrementalHoareTripleChecker+Valid, 6761 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:55,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2862 Valid, 8216 Invalid, 8381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1615 Valid, 6761 Invalid, 5 Unknown, 0 Unchecked, 16.3s Time] [2022-07-23 04:15:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2022-07-23 04:15:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 2372. [2022-07-23 04:15:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1731 states have (on average 1.266897746967071) internal successors, (2193), 1758 states have internal predecessors, (2193), 525 states have call successors, (525), 115 states have call predecessors, (525), 114 states have return successors, (523), 519 states have call predecessors, (523), 523 states have call successors, (523) [2022-07-23 04:15:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3241 transitions. [2022-07-23 04:15:55,784 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3241 transitions. Word has length 340 [2022-07-23 04:15:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:55,785 INFO L495 AbstractCegarLoop]: Abstraction has 2372 states and 3241 transitions. [2022-07-23 04:15:55,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:15:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3241 transitions. [2022-07-23 04:15:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-07-23 04:15:55,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:55,792 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:15:55,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:15:55,792 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1339255463, now seen corresponding path program 1 times [2022-07-23 04:15:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:55,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576167037] [2022-07-23 04:15:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:15:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:15:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:15:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:15:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:15:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:15:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 04:15:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:15:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 04:15:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 04:15:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 04:15:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-23 04:15:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:15:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:15:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 04:15:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-23 04:15:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-23 04:15:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-23 04:15:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-23 04:15:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-23 04:15:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-23 04:15:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:15:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 04:15:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-23 04:15:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-23 04:15:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-23 04:15:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-23 04:15:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-23 04:15:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-07-23 04:15:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-23 04:15:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-23 04:15:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-23 04:15:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2022-07-23 04:15:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-23 04:15:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-07-23 04:15:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-23 04:15:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-07-23 04:15:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2022-07-23 04:15:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:56,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576167037] [2022-07-23 04:15:56,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576167037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:56,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326898399] [2022-07-23 04:15:56,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:56,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:56,676 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-23 04:15:56,677 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-23 04:15:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 4891 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 04:15:58,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-07-23 04:15:58,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:15:58,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326898399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:58,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:15:58,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 12 [2022-07-23 04:15:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067869931] [2022-07-23 04:15:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:58,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 04:15:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 04:15:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:15:58,232 INFO L87 Difference]: Start difference. First operand 2372 states and 3241 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) [2022-07-23 04:15:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:58,562 INFO L93 Difference]: Finished difference Result 5070 states and 6981 transitions. [2022-07-23 04:15:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 04:15:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) Word has length 420 [2022-07-23 04:15:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:58,572 INFO L225 Difference]: With dead ends: 5070 [2022-07-23 04:15:58,573 INFO L226 Difference]: Without dead ends: 2717 [2022-07-23 04:15:58,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:15:58,582 INFO L413 NwaCegarLoop]: 2203 mSDtfsCounter, 244 mSDsluCounter, 6228 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:58,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 8431 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 04:15:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2022-07-23 04:15:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2380. [2022-07-23 04:15:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1737 states have (on average 1.2659758203799654) internal successors, (2199), 1764 states have internal predecessors, (2199), 525 states have call successors, (525), 115 states have call predecessors, (525), 116 states have return successors, (531), 521 states have call predecessors, (531), 523 states have call successors, (531) [2022-07-23 04:15:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3255 transitions. [2022-07-23 04:15:58,821 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3255 transitions. Word has length 420 [2022-07-23 04:15:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:58,822 INFO L495 AbstractCegarLoop]: Abstraction has 2380 states and 3255 transitions. [2022-07-23 04:15:58,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) [2022-07-23 04:15:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3255 transitions. [2022-07-23 04:15:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2022-07-23 04:15:58,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:58,830 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:15:58,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 04:15:59,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-23 04:15:59,055 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:15:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash 550620124, now seen corresponding path program 1 times [2022-07-23 04:15:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:59,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015502402] [2022-07-23 04:15:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:15:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:15:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:15:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:15:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:15:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:15:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:15:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:15:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 04:15:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:15:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:15:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:15:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:15:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-23 04:15:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-23 04:15:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-23 04:15:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-23 04:15:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-23 04:15:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-23 04:15:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:15:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-23 04:15:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:15:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-23 04:15:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-23 04:15:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-07-23 04:15:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-23 04:15:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-23 04:15:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-23 04:15:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-07-23 04:15:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-07-23 04:15:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-07-23 04:15:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-07-23 04:15:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-07-23 04:15:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-07-23 04:15:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-07-23 04:15:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-23 04:15:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-23 04:15:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-23 04:15:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2022-07-23 04:15:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015502402] [2022-07-23 04:15:59,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015502402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:59,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:59,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 04:15:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559165044] [2022-07-23 04:15:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:59,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 04:15:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:59,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 04:15:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:15:59,653 INFO L87 Difference]: Start difference. First operand 2380 states and 3255 transitions. Second operand has 12 states, 12 states have (on average 14.25) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (54), 8 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-23 04:16:01,685 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-23 04:16:03,695 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-23 04:16:05,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:07,789 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-23 04:16:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:17,094 INFO L93 Difference]: Finished difference Result 6302 states and 9008 transitions. [2022-07-23 04:16:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:16:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (54), 8 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 2 states have call successors, (54) Word has length 429 [2022-07-23 04:16:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:17,104 INFO L225 Difference]: With dead ends: 6302 [2022-07-23 04:16:17,104 INFO L226 Difference]: Without dead ends: 3941 [2022-07-23 04:16:17,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2022-07-23 04:16:17,109 INFO L413 NwaCegarLoop]: 2098 mSDtfsCounter, 4586 mSDsluCounter, 6214 mSDsCounter, 0 mSdLazyCounter, 8364 mSolverCounterSat, 3929 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4765 SdHoareTripleChecker+Valid, 8312 SdHoareTripleChecker+Invalid, 12297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3929 IncrementalHoareTripleChecker+Valid, 8364 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:17,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4765 Valid, 8312 Invalid, 12297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3929 Valid, 8364 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2022-07-23 04:16:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-07-23 04:16:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 2388. [2022-07-23 04:16:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 1743 states have (on average 1.2650602409638554) internal successors, (2205), 1770 states have internal predecessors, (2205), 525 states have call successors, (525), 115 states have call predecessors, (525), 118 states have return successors, (533), 523 states have call predecessors, (533), 523 states have call successors, (533) [2022-07-23 04:16:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3263 transitions. [2022-07-23 04:16:17,280 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3263 transitions. Word has length 429 [2022-07-23 04:16:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:17,281 INFO L495 AbstractCegarLoop]: Abstraction has 2388 states and 3263 transitions. [2022-07-23 04:16:17,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (54), 8 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-23 04:16:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3263 transitions. [2022-07-23 04:16:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2022-07-23 04:16:17,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:17,287 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:16:17,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:16:17,288 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-23 04:16:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash -965771238, now seen corresponding path program 1 times [2022-07-23 04:16:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145474812] [2022-07-23 04:16:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:16:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:16:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:16:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:16:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:16:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:16:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:16:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:16:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:16:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 04:16:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:16:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:16:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 04:16:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:16:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:16:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-23 04:16:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-23 04:16:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-23 04:16:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-23 04:16:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-23 04:16:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-23 04:16:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-23 04:16:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-23 04:16:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-23 04:16:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-07-23 04:16:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-23 04:16:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-23 04:16:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-23 04:16:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-07-23 04:16:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-23 04:16:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-07-23 04:16:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-07-23 04:16:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-23 04:16:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-07-23 04:16:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2022-07-23 04:16:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-23 04:16:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-23 04:16:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2022-07-23 04:16:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-07-23 04:16:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-07-23 04:16:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:17,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145474812] [2022-07-23 04:16:17,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145474812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:17,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:17,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:16:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686662473] [2022-07-23 04:16:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:16:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:16:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:16:17,813 INFO L87 Difference]: Start difference. First operand 2388 states and 3263 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (55), 8 states have call predecessors, (55), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-23 04:16:19,839 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-23 04:16:21,870 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-23 04:16:23,903 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 []