./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--hid--usbhid--usbhid.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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--hid--usbhid--usbhid.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 7c12097eac5f261adffff229683e356131e183db7c13bb0d667f223c1dbcfa9a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:31:38,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:31:38,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:31:39,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:31:39,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:31:39,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:31:39,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:31:39,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:31:39,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:31:39,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:31:39,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:31:39,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:31:39,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:31:39,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:31:39,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:31:39,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:31:39,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:31:39,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:31:39,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:31:39,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:31:39,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:31:39,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:31:39,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:31:39,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:31:39,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:31:39,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:31:39,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:31:39,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:31:39,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:31:39,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:31:39,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:31:39,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:31:39,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:31:39,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:31:39,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:31:39,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:31:39,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:31:39,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:31:39,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:31:39,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:31:39,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:31:39,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:31:39,061 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:31:39,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:31:39,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:31:39,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:31:39,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:31:39,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:31:39,064 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:31:39,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:31:39,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:31:39,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:31:39,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:31:39,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:31:39,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:31:39,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:31:39,066 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:31:39,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:31:39,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:31:39,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:31:39,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:31:39,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:31:39,068 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:31:39,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:31:39,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:31:39,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:31:39,068 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 -> 7c12097eac5f261adffff229683e356131e183db7c13bb0d667f223c1dbcfa9a [2021-11-06 21:31:39,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:31:39,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:31:39,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:31:39,333 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:31:39,334 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:31:39,335 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--hid--usbhid--usbhid.ko.cil.i [2021-11-06 21:31:39,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b718bb7/6bddb4600c7a4244b304ed008dc581d5/FLAGcf2bfe022 [2021-11-06 21:31:40,042 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:31:40,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2021-11-06 21:31:40,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b718bb7/6bddb4600c7a4244b304ed008dc581d5/FLAGcf2bfe022 [2021-11-06 21:31:40,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b718bb7/6bddb4600c7a4244b304ed008dc581d5 [2021-11-06 21:31:40,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:31:40,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:31:40,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:31:40,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:31:40,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:31:40,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:31:40" (1/1) ... [2021-11-06 21:31:40,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603cfef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:40, skipping insertion in model container [2021-11-06 21:31:40,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:31:40" (1/1) ... [2021-11-06 21:31:40,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:31:40,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:31:43,789 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497733,497746] [2021-11-06 21:31:43,792 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2021-11-06 21:31:43,792 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2021-11-06 21:31:43,792 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2021-11-06 21:31:43,793 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2021-11-06 21:31:43,793 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2021-11-06 21:31:43,793 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2021-11-06 21:31:43,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2021-11-06 21:31:43,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2021-11-06 21:31:43,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2021-11-06 21:31:43,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2021-11-06 21:31:43,795 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2021-11-06 21:31:43,795 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2021-11-06 21:31:43,795 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2021-11-06 21:31:43,796 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2021-11-06 21:31:43,796 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2021-11-06 21:31:43,796 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2021-11-06 21:31:43,796 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2021-11-06 21:31:43,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2021-11-06 21:31:43,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2021-11-06 21:31:43,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2021-11-06 21:31:43,798 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2021-11-06 21:31:43,798 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2021-11-06 21:31:43,798 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2021-11-06 21:31:43,799 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2021-11-06 21:31:43,799 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501521,501534] [2021-11-06 21:31:43,800 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501673,501686] [2021-11-06 21:31:43,800 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501819,501832] [2021-11-06 21:31:43,800 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501964,501977] [2021-11-06 21:31:43,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502118,502131] [2021-11-06 21:31:43,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502269,502282] [2021-11-06 21:31:43,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2021-11-06 21:31:43,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2021-11-06 21:31:43,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2021-11-06 21:31:43,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2021-11-06 21:31:43,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2021-11-06 21:31:43,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2021-11-06 21:31:43,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2021-11-06 21:31:43,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503515,503528] [2021-11-06 21:31:43,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503682,503695] [2021-11-06 21:31:43,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503841,503854] [2021-11-06 21:31:43,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2021-11-06 21:31:43,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2021-11-06 21:31:43,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2021-11-06 21:31:43,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2021-11-06 21:31:43,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2021-11-06 21:31:43,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2021-11-06 21:31:43,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504928,504941] [2021-11-06 21:31:43,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505093,505106] [2021-11-06 21:31:43,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505258,505271] [2021-11-06 21:31:43,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505424,505437] [2021-11-06 21:31:43,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505589,505602] [2021-11-06 21:31:43,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2021-11-06 21:31:43,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2021-11-06 21:31:43,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2021-11-06 21:31:43,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2021-11-06 21:31:43,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2021-11-06 21:31:43,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2021-11-06 21:31:43,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2021-11-06 21:31:43,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2021-11-06 21:31:43,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506957,506970] [2021-11-06 21:31:43,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507098,507111] [2021-11-06 21:31:43,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507236,507249] [2021-11-06 21:31:43,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507394,507407] [2021-11-06 21:31:43,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507553,507566] [2021-11-06 21:31:43,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507709,507722] [2021-11-06 21:31:43,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2021-11-06 21:31:43,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2021-11-06 21:31:43,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2021-11-06 21:31:43,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2021-11-06 21:31:43,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508462,508475] [2021-11-06 21:31:43,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508610,508623] [2021-11-06 21:31:43,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2021-11-06 21:31:43,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2021-11-06 21:31:43,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2021-11-06 21:31:43,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2021-11-06 21:31:43,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2021-11-06 21:31:43,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2021-11-06 21:31:43,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2021-11-06 21:31:43,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2021-11-06 21:31:43,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2021-11-06 21:31:43,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2021-11-06 21:31:43,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2021-11-06 21:31:43,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2021-11-06 21:31:43,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2021-11-06 21:31:43,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2021-11-06 21:31:43,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2021-11-06 21:31:43,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2021-11-06 21:31:43,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:31:43,864 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:31:44,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497733,497746] [2021-11-06 21:31:44,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2021-11-06 21:31:44,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2021-11-06 21:31:44,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2021-11-06 21:31:44,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2021-11-06 21:31:44,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2021-11-06 21:31:44,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2021-11-06 21:31:44,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2021-11-06 21:31:44,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2021-11-06 21:31:44,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2021-11-06 21:31:44,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2021-11-06 21:31:44,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2021-11-06 21:31:44,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2021-11-06 21:31:44,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2021-11-06 21:31:44,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2021-11-06 21:31:44,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2021-11-06 21:31:44,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2021-11-06 21:31:44,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2021-11-06 21:31:44,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2021-11-06 21:31:44,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2021-11-06 21:31:44,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2021-11-06 21:31:44,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2021-11-06 21:31:44,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2021-11-06 21:31:44,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2021-11-06 21:31:44,199 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2021-11-06 21:31:44,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501521,501534] [2021-11-06 21:31:44,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501673,501686] [2021-11-06 21:31:44,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501819,501832] [2021-11-06 21:31:44,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501964,501977] [2021-11-06 21:31:44,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502118,502131] [2021-11-06 21:31:44,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502269,502282] [2021-11-06 21:31:44,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2021-11-06 21:31:44,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2021-11-06 21:31:44,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2021-11-06 21:31:44,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2021-11-06 21:31:44,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2021-11-06 21:31:44,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2021-11-06 21:31:44,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2021-11-06 21:31:44,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503515,503528] [2021-11-06 21:31:44,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503682,503695] [2021-11-06 21:31:44,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503841,503854] [2021-11-06 21:31:44,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2021-11-06 21:31:44,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2021-11-06 21:31:44,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2021-11-06 21:31:44,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2021-11-06 21:31:44,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2021-11-06 21:31:44,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2021-11-06 21:31:44,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504928,504941] [2021-11-06 21:31:44,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505093,505106] [2021-11-06 21:31:44,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505258,505271] [2021-11-06 21:31:44,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505424,505437] [2021-11-06 21:31:44,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505589,505602] [2021-11-06 21:31:44,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2021-11-06 21:31:44,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2021-11-06 21:31:44,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2021-11-06 21:31:44,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2021-11-06 21:31:44,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2021-11-06 21:31:44,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2021-11-06 21:31:44,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2021-11-06 21:31:44,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2021-11-06 21:31:44,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506957,506970] [2021-11-06 21:31:44,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507098,507111] [2021-11-06 21:31:44,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507236,507249] [2021-11-06 21:31:44,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507394,507407] [2021-11-06 21:31:44,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507553,507566] [2021-11-06 21:31:44,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507709,507722] [2021-11-06 21:31:44,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2021-11-06 21:31:44,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2021-11-06 21:31:44,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2021-11-06 21:31:44,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2021-11-06 21:31:44,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508462,508475] [2021-11-06 21:31:44,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508610,508623] [2021-11-06 21:31:44,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2021-11-06 21:31:44,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2021-11-06 21:31:44,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2021-11-06 21:31:44,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2021-11-06 21:31:44,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2021-11-06 21:31:44,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2021-11-06 21:31:44,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2021-11-06 21:31:44,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2021-11-06 21:31:44,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2021-11-06 21:31:44,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2021-11-06 21:31:44,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2021-11-06 21:31:44,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2021-11-06 21:31:44,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2021-11-06 21:31:44,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2021-11-06 21:31:44,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2021-11-06 21:31:44,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2021-11-06 21:31:44,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:31:44,434 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:31:44,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44 WrapperNode [2021-11-06 21:31:44,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:31:44,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:31:44,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:31:44,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:31:44,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:44,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:45,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:31:45,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:31:45,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:31:45,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:31:45,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:45,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:45,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:45,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:46,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:46,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:46,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:46,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:31:46,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:31:46,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:31:46,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:31:46,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (1/1) ... [2021-11-06 21:31:46,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:31:46,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:31:47,025 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) [2021-11-06 21:31:47,079 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 [2021-11-06 21:31:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-06 21:31:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_request_effect_upload [2021-11-06 21:31:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_request_effect_upload [2021-11-06 21:31:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure hid_suspend [2021-11-06 21:31:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_suspend [2021-11-06 21:31:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 21:31:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:31:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2021-11-06 21:31:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2021-11-06 21:31:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:31:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2021-11-06 21:31:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2021-11-06 21:31:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:31:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 21:31:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_wait [2021-11-06 21:31:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_wait [2021-11-06 21:31:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2021-11-06 21:31:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2021-11-06 21:31:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure hid_io_error [2021-11-06 21:31:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_io_error [2021-11-06 21:31:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:31:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:31:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:31:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:31:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:31:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure hid_reset_resume [2021-11-06 21:31:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_reset_resume [2021-11-06 21:31:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:31:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_reset [2021-11-06 21:31:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_reset [2021-11-06 21:31:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume [2021-11-06 21:31:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume [2021-11-06 21:31:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure hid_retry_timeout [2021-11-06 21:31:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_retry_timeout [2021-11-06 21:31:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_3 [2021-11-06 21:31:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_3 [2021-11-06 21:31:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume_common [2021-11-06 21:31:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume_common [2021-11-06 21:31:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:31:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:31:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pidff_init [2021-11-06 21:31:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pidff_init [2021-11-06 21:31:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:31:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_3_2 [2021-11-06 21:31:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_3_2 [2021-11-06 21:31:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_autocenter [2021-11-06 21:31:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_autocenter [2021-11-06 21:31:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:31:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:31:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_99 [2021-11-06 21:31:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_99 [2021-11-06 21:31:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:31:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:31:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_7_2 [2021-11-06 21:31:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_7_2 [2021-11-06 21:31:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:33:00,559 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L8746: #t~ret2475 := main_#res; [2021-11-06 21:33:00,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:33:00,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_10_returnLabel: main_#res := 0; [2021-11-06 21:33:02,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:33:02,728 INFO L299 CfgBuilder]: Removed 9704 assume(true) statements. [2021-11-06 21:33:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:33:02 BoogieIcfgContainer [2021-11-06 21:33:02,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:33:02,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:33:02,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:33:02,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:33:02,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:31:40" (1/3) ... [2021-11-06 21:33:02,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1b5a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:33:02, skipping insertion in model container [2021-11-06 21:33:02,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:44" (2/3) ... [2021-11-06 21:33:02,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1b5a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:33:02, skipping insertion in model container [2021-11-06 21:33:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:33:02" (3/3) ... [2021-11-06 21:33:02,751 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2021-11-06 21:33:02,755 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:33:02,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 411 error locations. [2021-11-06 21:33:02,802 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:33:02,805 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:33:02,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 411 error locations. [2021-11-06 21:33:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 9891 states, 9417 states have (on average 1.412764149941595) internal successors, (13304), 9833 states have internal predecessors, (13304), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-11-06 21:33:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 21:33:02,895 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:02,895 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:02,896 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -971497555, now seen corresponding path program 1 times [2021-11-06 21:33:02,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:02,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596661597] [2021-11-06 21:33:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:02,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:03,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:03,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596661597] [2021-11-06 21:33:03,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596661597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:03,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:03,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:33:03,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421375825] [2021-11-06 21:33:03,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:33:03,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:33:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:03,798 INFO L87 Difference]: Start difference. First operand has 9891 states, 9417 states have (on average 1.412764149941595) internal successors, (13304), 9833 states have internal predecessors, (13304), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:05,076 INFO L93 Difference]: Finished difference Result 24847 states and 33714 transitions. [2021-11-06 21:33:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-06 21:33:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:05,165 INFO L225 Difference]: With dead ends: 24847 [2021-11-06 21:33:05,165 INFO L226 Difference]: Without dead ends: 14456 [2021-11-06 21:33:05,207 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:33:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2021-11-06 21:33:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 9590. [2021-11-06 21:33:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9111 states have (on average 1.3362967841071232) internal successors, (12175), 9527 states have internal predecessors, (12175), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2021-11-06 21:33:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 12270 transitions. [2021-11-06 21:33:05,543 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 12270 transitions. Word has length 15 [2021-11-06 21:33:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:05,544 INFO L470 AbstractCegarLoop]: Abstraction has 9590 states and 12270 transitions. [2021-11-06 21:33:05,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 12270 transitions. [2021-11-06 21:33:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 21:33:05,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:05,545 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:05,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:33:05,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -971437973, now seen corresponding path program 1 times [2021-11-06 21:33:05,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:05,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982929819] [2021-11-06 21:33:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:05,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:05,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:05,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982929819] [2021-11-06 21:33:05,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982929819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:05,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:05,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:33:05,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234532944] [2021-11-06 21:33:05,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:05,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:05,781 INFO L87 Difference]: Start difference. First operand 9590 states and 12270 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:06,483 INFO L93 Difference]: Finished difference Result 12390 states and 15808 transitions. [2021-11-06 21:33:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-06 21:33:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:06,522 INFO L225 Difference]: With dead ends: 12390 [2021-11-06 21:33:06,523 INFO L226 Difference]: Without dead ends: 12274 [2021-11-06 21:33:06,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12274 states. [2021-11-06 21:33:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12274 to 9474. [2021-11-06 21:33:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9053 states have (on average 1.3320446260907985) internal successors, (12059), 9411 states have internal predecessors, (12059), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2021-11-06 21:33:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 12154 transitions. [2021-11-06 21:33:06,778 INFO L78 Accepts]: Start accepts. Automaton has 9474 states and 12154 transitions. Word has length 15 [2021-11-06 21:33:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:06,778 INFO L470 AbstractCegarLoop]: Abstraction has 9474 states and 12154 transitions. [2021-11-06 21:33:06,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 9474 states and 12154 transitions. [2021-11-06 21:33:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-06 21:33:06,780 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:06,780 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:06,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:33:06,780 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -607111862, now seen corresponding path program 1 times [2021-11-06 21:33:06,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:06,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335856935] [2021-11-06 21:33:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:06,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:07,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:07,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335856935] [2021-11-06 21:33:07,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335856935] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:07,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:07,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:33:07,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917933642] [2021-11-06 21:33:07,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:33:07,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:33:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:07,019 INFO L87 Difference]: Start difference. First operand 9474 states and 12154 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:07,421 INFO L93 Difference]: Finished difference Result 18665 states and 24071 transitions. [2021-11-06 21:33:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:33:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-06 21:33:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:07,444 INFO L225 Difference]: With dead ends: 18665 [2021-11-06 21:33:07,444 INFO L226 Difference]: Without dead ends: 9195 [2021-11-06 21:33:07,473 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9195 states. [2021-11-06 21:33:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9195 to 9195. [2021-11-06 21:33:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9195 states, 8867 states have (on average 1.3180331566482464) internal successors, (11687), 9132 states have internal predecessors, (11687), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2021-11-06 21:33:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9195 states to 9195 states and 11782 transitions. [2021-11-06 21:33:07,679 INFO L78 Accepts]: Start accepts. Automaton has 9195 states and 11782 transitions. Word has length 18 [2021-11-06 21:33:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:07,679 INFO L470 AbstractCegarLoop]: Abstraction has 9195 states and 11782 transitions. [2021-11-06 21:33:07,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9195 states and 11782 transitions. [2021-11-06 21:33:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 21:33:07,680 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:07,680 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:07,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:33:07,681 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1633852410, now seen corresponding path program 1 times [2021-11-06 21:33:07,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:07,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008099774] [2021-11-06 21:33:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:07,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:07,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:07,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008099774] [2021-11-06 21:33:07,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008099774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:07,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:07,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:33:07,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176466931] [2021-11-06 21:33:07,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:07,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:07,993 INFO L87 Difference]: Start difference. First operand 9195 states and 11782 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:08,397 INFO L93 Difference]: Finished difference Result 23059 states and 29559 transitions. [2021-11-06 21:33:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 21:33:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:08,434 INFO L225 Difference]: With dead ends: 23059 [2021-11-06 21:33:08,434 INFO L226 Difference]: Without dead ends: 14578 [2021-11-06 21:33:08,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14578 states. [2021-11-06 21:33:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14578 to 9195. [2021-11-06 21:33:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9195 states, 8867 states have (on average 1.3179203789331229) internal successors, (11686), 9132 states have internal predecessors, (11686), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2021-11-06 21:33:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9195 states to 9195 states and 11781 transitions. [2021-11-06 21:33:08,706 INFO L78 Accepts]: Start accepts. Automaton has 9195 states and 11781 transitions. Word has length 25 [2021-11-06 21:33:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:08,707 INFO L470 AbstractCegarLoop]: Abstraction has 9195 states and 11781 transitions. [2021-11-06 21:33:08,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9195 states and 11781 transitions. [2021-11-06 21:33:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:33:08,708 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:08,708 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:08,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:33:08,708 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1687423010, now seen corresponding path program 1 times [2021-11-06 21:33:08,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:08,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927464411] [2021-11-06 21:33:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:08,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:08,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:08,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927464411] [2021-11-06 21:33:08,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927464411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:08,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:08,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 21:33:08,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583452670] [2021-11-06 21:33:08,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 21:33:08,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 21:33:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:33:08,941 INFO L87 Difference]: Start difference. First operand 9195 states and 11781 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:09,924 INFO L93 Difference]: Finished difference Result 28927 states and 37009 transitions. [2021-11-06 21:33:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 21:33:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-06 21:33:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:09,966 INFO L225 Difference]: With dead ends: 28927 [2021-11-06 21:33:09,967 INFO L226 Difference]: Without dead ends: 20447 [2021-11-06 21:33:09,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:33:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20447 states. [2021-11-06 21:33:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20447 to 9654. [2021-11-06 21:33:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9654 states, 9322 states have (on average 1.3143102338553958) internal successors, (12252), 9588 states have internal predecessors, (12252), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9654 states to 9654 states and 12355 transitions. [2021-11-06 21:33:10,331 INFO L78 Accepts]: Start accepts. Automaton has 9654 states and 12355 transitions. Word has length 35 [2021-11-06 21:33:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:10,331 INFO L470 AbstractCegarLoop]: Abstraction has 9654 states and 12355 transitions. [2021-11-06 21:33:10,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9654 states and 12355 transitions. [2021-11-06 21:33:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:33:10,333 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:10,333 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:10,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:33:10,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1553409504, now seen corresponding path program 1 times [2021-11-06 21:33:10,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:10,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504901287] [2021-11-06 21:33:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:10,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:10,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:10,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504901287] [2021-11-06 21:33:10,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504901287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:10,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:10,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:10,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850601446] [2021-11-06 21:33:10,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:10,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:10,607 INFO L87 Difference]: Start difference. First operand 9654 states and 12355 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:10,850 INFO L93 Difference]: Finished difference Result 9654 states and 12355 transitions. [2021-11-06 21:33:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-06 21:33:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:10,866 INFO L225 Difference]: With dead ends: 9654 [2021-11-06 21:33:10,866 INFO L226 Difference]: Without dead ends: 9650 [2021-11-06 21:33:10,869 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2021-11-06 21:33:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 9650. [2021-11-06 21:33:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9650 states, 9320 states have (on average 1.3141630901287553) internal successors, (12248), 9584 states have internal predecessors, (12248), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9650 states to 9650 states and 12351 transitions. [2021-11-06 21:33:11,178 INFO L78 Accepts]: Start accepts. Automaton has 9650 states and 12351 transitions. Word has length 35 [2021-11-06 21:33:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:11,178 INFO L470 AbstractCegarLoop]: Abstraction has 9650 states and 12351 transitions. [2021-11-06 21:33:11,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9650 states and 12351 transitions. [2021-11-06 21:33:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:33:11,182 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:11,182 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:11,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:33:11,183 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1821644412, now seen corresponding path program 1 times [2021-11-06 21:33:11,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:11,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830962592] [2021-11-06 21:33:11,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:11,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:11,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:11,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830962592] [2021-11-06 21:33:11,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830962592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:11,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:11,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:11,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564298341] [2021-11-06 21:33:11,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:11,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:11,414 INFO L87 Difference]: Start difference. First operand 9650 states and 12351 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:11,670 INFO L93 Difference]: Finished difference Result 9650 states and 12351 transitions. [2021-11-06 21:33:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-06 21:33:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:11,688 INFO L225 Difference]: With dead ends: 9650 [2021-11-06 21:33:11,688 INFO L226 Difference]: Without dead ends: 9646 [2021-11-06 21:33:11,692 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9646 states. [2021-11-06 21:33:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9646 to 9646. [2021-11-06 21:33:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9646 states, 9318 states have (on average 1.3140158832367461) internal successors, (12244), 9580 states have internal predecessors, (12244), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 12347 transitions. [2021-11-06 21:33:11,987 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 12347 transitions. Word has length 37 [2021-11-06 21:33:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:11,988 INFO L470 AbstractCegarLoop]: Abstraction has 9646 states and 12347 transitions. [2021-11-06 21:33:11,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 12347 transitions. [2021-11-06 21:33:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:33:11,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:11,989 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:11,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:33:11,989 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1746818440, now seen corresponding path program 1 times [2021-11-06 21:33:11,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:11,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178352839] [2021-11-06 21:33:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:11,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:12,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:12,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178352839] [2021-11-06 21:33:12,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178352839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:12,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:12,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:12,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150974640] [2021-11-06 21:33:12,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:12,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:12,238 INFO L87 Difference]: Start difference. First operand 9646 states and 12347 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:12,492 INFO L93 Difference]: Finished difference Result 9646 states and 12347 transitions. [2021-11-06 21:33:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:12,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 21:33:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:12,508 INFO L225 Difference]: With dead ends: 9646 [2021-11-06 21:33:12,509 INFO L226 Difference]: Without dead ends: 9642 [2021-11-06 21:33:12,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9642 states. [2021-11-06 21:33:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9642 to 9642. [2021-11-06 21:33:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9642 states, 9316 states have (on average 1.313868613138686) internal successors, (12240), 9576 states have internal predecessors, (12240), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 12343 transitions. [2021-11-06 21:33:12,801 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 12343 transitions. Word has length 39 [2021-11-06 21:33:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:12,803 INFO L470 AbstractCegarLoop]: Abstraction has 9642 states and 12343 transitions. [2021-11-06 21:33:12,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 12343 transitions. [2021-11-06 21:33:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:33:12,804 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:12,805 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:12,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:33:12,805 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash -639249940, now seen corresponding path program 1 times [2021-11-06 21:33:12,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:12,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195381612] [2021-11-06 21:33:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:12,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:13,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:13,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195381612] [2021-11-06 21:33:13,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195381612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:13,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:13,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:13,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208158485] [2021-11-06 21:33:13,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:13,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:13,040 INFO L87 Difference]: Start difference. First operand 9642 states and 12343 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:13,427 INFO L93 Difference]: Finished difference Result 9642 states and 12343 transitions. [2021-11-06 21:33:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 21:33:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:13,442 INFO L225 Difference]: With dead ends: 9642 [2021-11-06 21:33:13,442 INFO L226 Difference]: Without dead ends: 9638 [2021-11-06 21:33:13,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2021-11-06 21:33:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 9638. [2021-11-06 21:33:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9314 states have (on average 1.3137212797938587) internal successors, (12236), 9572 states have internal predecessors, (12236), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 12339 transitions. [2021-11-06 21:33:13,735 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 12339 transitions. Word has length 41 [2021-11-06 21:33:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:13,735 INFO L470 AbstractCegarLoop]: Abstraction has 9638 states and 12339 transitions. [2021-11-06 21:33:13,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 12339 transitions. [2021-11-06 21:33:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:33:13,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:13,736 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:13,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:33:13,737 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash -138426704, now seen corresponding path program 1 times [2021-11-06 21:33:13,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:13,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932187375] [2021-11-06 21:33:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:13,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:13,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:13,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932187375] [2021-11-06 21:33:13,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932187375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:13,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:13,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:13,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879363771] [2021-11-06 21:33:13,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:13,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:13,971 INFO L87 Difference]: Start difference. First operand 9638 states and 12339 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:14,251 INFO L93 Difference]: Finished difference Result 9638 states and 12339 transitions. [2021-11-06 21:33:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:14,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 21:33:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:14,269 INFO L225 Difference]: With dead ends: 9638 [2021-11-06 21:33:14,270 INFO L226 Difference]: Without dead ends: 9634 [2021-11-06 21:33:14,273 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2021-11-06 21:33:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 9634. [2021-11-06 21:33:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 9312 states have (on average 1.313573883161512) internal successors, (12232), 9568 states have internal predecessors, (12232), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 12335 transitions. [2021-11-06 21:33:14,586 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 12335 transitions. Word has length 43 [2021-11-06 21:33:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:14,587 INFO L470 AbstractCegarLoop]: Abstraction has 9634 states and 12335 transitions. [2021-11-06 21:33:14,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 12335 transitions. [2021-11-06 21:33:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:33:14,588 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:14,588 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:14,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:33:14,588 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 116366292, now seen corresponding path program 1 times [2021-11-06 21:33:14,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:14,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949269654] [2021-11-06 21:33:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:14,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:14,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:14,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949269654] [2021-11-06 21:33:14,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949269654] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:14,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:14,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:14,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223340710] [2021-11-06 21:33:14,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:14,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:14,986 INFO L87 Difference]: Start difference. First operand 9634 states and 12335 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:15,264 INFO L93 Difference]: Finished difference Result 9634 states and 12335 transitions. [2021-11-06 21:33:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 21:33:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:15,282 INFO L225 Difference]: With dead ends: 9634 [2021-11-06 21:33:15,282 INFO L226 Difference]: Without dead ends: 9630 [2021-11-06 21:33:15,286 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9630 states. [2021-11-06 21:33:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9630 to 9630. [2021-11-06 21:33:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9630 states, 9310 states have (on average 1.3134264232008592) internal successors, (12228), 9564 states have internal predecessors, (12228), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 12331 transitions. [2021-11-06 21:33:15,605 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 12331 transitions. Word has length 45 [2021-11-06 21:33:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:15,605 INFO L470 AbstractCegarLoop]: Abstraction has 9630 states and 12331 transitions. [2021-11-06 21:33:15,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 12331 transitions. [2021-11-06 21:33:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:33:15,606 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:15,606 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:15,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:33:15,606 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash 159299928, now seen corresponding path program 1 times [2021-11-06 21:33:15,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:15,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256398165] [2021-11-06 21:33:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:15,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:15,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:15,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256398165] [2021-11-06 21:33:15,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256398165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:15,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:15,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:15,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177371786] [2021-11-06 21:33:15,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:15,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:15,828 INFO L87 Difference]: Start difference. First operand 9630 states and 12331 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:16,111 INFO L93 Difference]: Finished difference Result 9630 states and 12331 transitions. [2021-11-06 21:33:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 21:33:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:16,127 INFO L225 Difference]: With dead ends: 9630 [2021-11-06 21:33:16,127 INFO L226 Difference]: Without dead ends: 9626 [2021-11-06 21:33:16,131 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2021-11-06 21:33:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 9626. [2021-11-06 21:33:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9626 states, 9308 states have (on average 1.3132788998710787) internal successors, (12224), 9560 states have internal predecessors, (12224), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 12327 transitions. [2021-11-06 21:33:16,451 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 12327 transitions. Word has length 47 [2021-11-06 21:33:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:16,451 INFO L470 AbstractCegarLoop]: Abstraction has 9626 states and 12327 transitions. [2021-11-06 21:33:16,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 12327 transitions. [2021-11-06 21:33:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:33:16,452 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:16,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:16,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:33:16,453 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1531148484, now seen corresponding path program 1 times [2021-11-06 21:33:16,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:16,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631090118] [2021-11-06 21:33:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:16,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:16,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:16,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631090118] [2021-11-06 21:33:16,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631090118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:16,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:16,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:16,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683616917] [2021-11-06 21:33:16,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:16,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:16,675 INFO L87 Difference]: Start difference. First operand 9626 states and 12327 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:16,975 INFO L93 Difference]: Finished difference Result 9626 states and 12327 transitions. [2021-11-06 21:33:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 21:33:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:16,992 INFO L225 Difference]: With dead ends: 9626 [2021-11-06 21:33:16,993 INFO L226 Difference]: Without dead ends: 9622 [2021-11-06 21:33:16,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2021-11-06 21:33:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 9622. [2021-11-06 21:33:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9622 states, 9306 states have (on average 1.3131313131313131) internal successors, (12220), 9556 states have internal predecessors, (12220), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9622 states to 9622 states and 12323 transitions. [2021-11-06 21:33:17,324 INFO L78 Accepts]: Start accepts. Automaton has 9622 states and 12323 transitions. Word has length 49 [2021-11-06 21:33:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:17,324 INFO L470 AbstractCegarLoop]: Abstraction has 9622 states and 12323 transitions. [2021-11-06 21:33:17,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9622 states and 12323 transitions. [2021-11-06 21:33:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:33:17,325 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:17,325 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:17,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:33:17,326 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1740532127, now seen corresponding path program 1 times [2021-11-06 21:33:17,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:17,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462742709] [2021-11-06 21:33:17,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:17,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:17,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:17,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462742709] [2021-11-06 21:33:17,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462742709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:17,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:17,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:17,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223465933] [2021-11-06 21:33:17,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:17,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:17,553 INFO L87 Difference]: Start difference. First operand 9622 states and 12323 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:17,967 INFO L93 Difference]: Finished difference Result 9622 states and 12323 transitions. [2021-11-06 21:33:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:17,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 21:33:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:17,988 INFO L225 Difference]: With dead ends: 9622 [2021-11-06 21:33:17,988 INFO L226 Difference]: Without dead ends: 9618 [2021-11-06 21:33:17,993 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2021-11-06 21:33:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 9618. [2021-11-06 21:33:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9618 states, 9304 states have (on average 1.3129836629406706) internal successors, (12216), 9552 states have internal predecessors, (12216), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9618 states to 9618 states and 12319 transitions. [2021-11-06 21:33:18,345 INFO L78 Accepts]: Start accepts. Automaton has 9618 states and 12319 transitions. Word has length 51 [2021-11-06 21:33:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:18,345 INFO L470 AbstractCegarLoop]: Abstraction has 9618 states and 12319 transitions. [2021-11-06 21:33:18,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9618 states and 12319 transitions. [2021-11-06 21:33:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:33:18,346 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:18,346 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:18,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:33:18,346 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1909539939, now seen corresponding path program 1 times [2021-11-06 21:33:18,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:18,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529398573] [2021-11-06 21:33:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:18,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:18,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:18,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529398573] [2021-11-06 21:33:18,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529398573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:18,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:18,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:18,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611729118] [2021-11-06 21:33:18,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:18,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:18,567 INFO L87 Difference]: Start difference. First operand 9618 states and 12319 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:18,915 INFO L93 Difference]: Finished difference Result 9618 states and 12319 transitions. [2021-11-06 21:33:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 21:33:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:18,935 INFO L225 Difference]: With dead ends: 9618 [2021-11-06 21:33:18,935 INFO L226 Difference]: Without dead ends: 9614 [2021-11-06 21:33:18,941 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9614 states. [2021-11-06 21:33:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9614 to 9614. [2021-11-06 21:33:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 9302 states have (on average 1.312835949258224) internal successors, (12212), 9548 states have internal predecessors, (12212), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 12315 transitions. [2021-11-06 21:33:19,318 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 12315 transitions. Word has length 53 [2021-11-06 21:33:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:19,319 INFO L470 AbstractCegarLoop]: Abstraction has 9614 states and 12315 transitions. [2021-11-06 21:33:19,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 12315 transitions. [2021-11-06 21:33:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:33:19,320 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:19,320 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:19,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:33:19,320 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1117290375, now seen corresponding path program 1 times [2021-11-06 21:33:19,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:19,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107364475] [2021-11-06 21:33:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:19,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:19,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:19,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107364475] [2021-11-06 21:33:19,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107364475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:19,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:19,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:19,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284726549] [2021-11-06 21:33:19,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:19,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:19,547 INFO L87 Difference]: Start difference. First operand 9614 states and 12315 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:19,890 INFO L93 Difference]: Finished difference Result 9614 states and 12315 transitions. [2021-11-06 21:33:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 21:33:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:19,905 INFO L225 Difference]: With dead ends: 9614 [2021-11-06 21:33:19,905 INFO L226 Difference]: Without dead ends: 9610 [2021-11-06 21:33:19,909 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2021-11-06 21:33:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9610. [2021-11-06 21:33:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9610 states, 9300 states have (on average 1.3126881720430108) internal successors, (12208), 9544 states have internal predecessors, (12208), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9610 states to 9610 states and 12311 transitions. [2021-11-06 21:33:20,258 INFO L78 Accepts]: Start accepts. Automaton has 9610 states and 12311 transitions. Word has length 55 [2021-11-06 21:33:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:20,258 INFO L470 AbstractCegarLoop]: Abstraction has 9610 states and 12311 transitions. [2021-11-06 21:33:20,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 12311 transitions. [2021-11-06 21:33:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:33:20,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:20,259 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:20,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:33:20,260 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash -25328885, now seen corresponding path program 1 times [2021-11-06 21:33:20,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:20,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610184619] [2021-11-06 21:33:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:20,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:20,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:20,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610184619] [2021-11-06 21:33:20,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610184619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:20,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:20,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:20,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667558738] [2021-11-06 21:33:20,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:20,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:20,493 INFO L87 Difference]: Start difference. First operand 9610 states and 12311 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:20,976 INFO L93 Difference]: Finished difference Result 9610 states and 12311 transitions. [2021-11-06 21:33:20,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 21:33:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:20,991 INFO L225 Difference]: With dead ends: 9610 [2021-11-06 21:33:20,991 INFO L226 Difference]: Without dead ends: 9606 [2021-11-06 21:33:20,995 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2021-11-06 21:33:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9606. [2021-11-06 21:33:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9606 states, 9298 states have (on average 1.3125403312540331) internal successors, (12204), 9540 states have internal predecessors, (12204), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9606 states to 9606 states and 12307 transitions. [2021-11-06 21:33:21,357 INFO L78 Accepts]: Start accepts. Automaton has 9606 states and 12307 transitions. Word has length 57 [2021-11-06 21:33:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:21,357 INFO L470 AbstractCegarLoop]: Abstraction has 9606 states and 12307 transitions. [2021-11-06 21:33:21,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9606 states and 12307 transitions. [2021-11-06 21:33:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:33:21,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:21,359 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:21,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:33:21,360 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1429190383, now seen corresponding path program 1 times [2021-11-06 21:33:21,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:21,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746005692] [2021-11-06 21:33:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:21,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:21,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:21,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746005692] [2021-11-06 21:33:21,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746005692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:21,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:21,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:21,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639423353] [2021-11-06 21:33:21,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:21,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:21,574 INFO L87 Difference]: Start difference. First operand 9606 states and 12307 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:21,926 INFO L93 Difference]: Finished difference Result 9606 states and 12307 transitions. [2021-11-06 21:33:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 21:33:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:21,939 INFO L225 Difference]: With dead ends: 9606 [2021-11-06 21:33:21,940 INFO L226 Difference]: Without dead ends: 9602 [2021-11-06 21:33:21,943 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2021-11-06 21:33:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 9602. [2021-11-06 21:33:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9602 states, 9296 states have (on average 1.3123924268502583) internal successors, (12200), 9536 states have internal predecessors, (12200), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9602 states to 9602 states and 12303 transitions. [2021-11-06 21:33:22,316 INFO L78 Accepts]: Start accepts. Automaton has 9602 states and 12303 transitions. Word has length 59 [2021-11-06 21:33:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:22,316 INFO L470 AbstractCegarLoop]: Abstraction has 9602 states and 12303 transitions. [2021-11-06 21:33:22,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9602 states and 12303 transitions. [2021-11-06 21:33:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:33:22,317 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:22,317 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:22,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:33:22,317 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -937131213, now seen corresponding path program 1 times [2021-11-06 21:33:22,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:22,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976344482] [2021-11-06 21:33:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:22,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:22,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:22,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976344482] [2021-11-06 21:33:22,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976344482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:22,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:22,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:22,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638759859] [2021-11-06 21:33:22,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:22,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:22,530 INFO L87 Difference]: Start difference. First operand 9602 states and 12303 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:22,895 INFO L93 Difference]: Finished difference Result 9602 states and 12303 transitions. [2021-11-06 21:33:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 21:33:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:22,907 INFO L225 Difference]: With dead ends: 9602 [2021-11-06 21:33:22,908 INFO L226 Difference]: Without dead ends: 9598 [2021-11-06 21:33:22,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2021-11-06 21:33:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 9598. [2021-11-06 21:33:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 9294 states have (on average 1.3122444587906177) internal successors, (12196), 9532 states have internal predecessors, (12196), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 12299 transitions. [2021-11-06 21:33:23,417 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 12299 transitions. Word has length 61 [2021-11-06 21:33:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:23,418 INFO L470 AbstractCegarLoop]: Abstraction has 9598 states and 12299 transitions. [2021-11-06 21:33:23,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 12299 transitions. [2021-11-06 21:33:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:33:23,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:23,419 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:23,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:33:23,419 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1360482263, now seen corresponding path program 1 times [2021-11-06 21:33:23,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:23,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786109932] [2021-11-06 21:33:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:23,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:23,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:23,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786109932] [2021-11-06 21:33:23,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786109932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:23,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:23,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:23,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193568445] [2021-11-06 21:33:23,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:23,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:23,639 INFO L87 Difference]: Start difference. First operand 9598 states and 12299 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:24,051 INFO L93 Difference]: Finished difference Result 9598 states and 12299 transitions. [2021-11-06 21:33:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 21:33:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:24,067 INFO L225 Difference]: With dead ends: 9598 [2021-11-06 21:33:24,067 INFO L226 Difference]: Without dead ends: 9594 [2021-11-06 21:33:24,072 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2021-11-06 21:33:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 9594. [2021-11-06 21:33:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9594 states, 9292 states have (on average 1.3120964270340076) internal successors, (12192), 9528 states have internal predecessors, (12192), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9594 states to 9594 states and 12295 transitions. [2021-11-06 21:33:24,493 INFO L78 Accepts]: Start accepts. Automaton has 9594 states and 12295 transitions. Word has length 63 [2021-11-06 21:33:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:24,494 INFO L470 AbstractCegarLoop]: Abstraction has 9594 states and 12295 transitions. [2021-11-06 21:33:24,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9594 states and 12295 transitions. [2021-11-06 21:33:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 21:33:24,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:24,495 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:24,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:33:24,495 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1291579823, now seen corresponding path program 1 times [2021-11-06 21:33:24,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:24,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587334476] [2021-11-06 21:33:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:24,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:24,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:24,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587334476] [2021-11-06 21:33:24,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587334476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:24,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:24,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:24,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570162429] [2021-11-06 21:33:24,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:33:24,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:33:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:24,701 INFO L87 Difference]: Start difference. First operand 9594 states and 12295 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:25,205 INFO L93 Difference]: Finished difference Result 18817 states and 24128 transitions. [2021-11-06 21:33:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:33:25,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 21:33:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:25,222 INFO L225 Difference]: With dead ends: 18817 [2021-11-06 21:33:25,223 INFO L226 Difference]: Without dead ends: 9590 [2021-11-06 21:33:25,240 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9590 states. [2021-11-06 21:33:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9590 to 9590. [2021-11-06 21:33:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9289 states have (on average 1.3117666056626116) internal successors, (12185), 9524 states have internal predecessors, (12185), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 12288 transitions. [2021-11-06 21:33:25,667 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 12288 transitions. Word has length 64 [2021-11-06 21:33:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:25,667 INFO L470 AbstractCegarLoop]: Abstraction has 9590 states and 12288 transitions. [2021-11-06 21:33:25,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 12288 transitions. [2021-11-06 21:33:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:33:25,672 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:25,673 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:25,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:33:25,673 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1753842907, now seen corresponding path program 1 times [2021-11-06 21:33:25,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:25,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333258473] [2021-11-06 21:33:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:25,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:26,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:26,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333258473] [2021-11-06 21:33:26,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333258473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:26,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:26,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:26,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438433280] [2021-11-06 21:33:26,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:26,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:26,344 INFO L87 Difference]: Start difference. First operand 9590 states and 12288 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:26,760 INFO L93 Difference]: Finished difference Result 9590 states and 12288 transitions. [2021-11-06 21:33:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 21:33:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:26,774 INFO L225 Difference]: With dead ends: 9590 [2021-11-06 21:33:26,774 INFO L226 Difference]: Without dead ends: 9586 [2021-11-06 21:33:26,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9586 states. [2021-11-06 21:33:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9586 to 9586. [2021-11-06 21:33:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9586 states, 9287 states have (on average 1.3116183912996662) internal successors, (12181), 9520 states have internal predecessors, (12181), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 12284 transitions. [2021-11-06 21:33:27,342 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 12284 transitions. Word has length 65 [2021-11-06 21:33:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:27,342 INFO L470 AbstractCegarLoop]: Abstraction has 9586 states and 12284 transitions. [2021-11-06 21:33:27,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 12284 transitions. [2021-11-06 21:33:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:33:27,343 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:27,343 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:27,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:33:27,344 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1490679228, now seen corresponding path program 1 times [2021-11-06 21:33:27,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:27,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389374999] [2021-11-06 21:33:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:27,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:27,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:27,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389374999] [2021-11-06 21:33:27,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389374999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:27,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:27,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:33:27,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636575261] [2021-11-06 21:33:27,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:33:27,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:27,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:33:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:27,575 INFO L87 Difference]: Start difference. First operand 9586 states and 12284 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:28,421 INFO L93 Difference]: Finished difference Result 18808 states and 24114 transitions. [2021-11-06 21:33:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 21:33:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:28,436 INFO L225 Difference]: With dead ends: 18808 [2021-11-06 21:33:28,436 INFO L226 Difference]: Without dead ends: 9595 [2021-11-06 21:33:28,448 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:33:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9595 states. [2021-11-06 21:33:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9595 to 9582. [2021-11-06 21:33:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9582 states, 9284 states have (on average 1.3112882378285222) internal successors, (12174), 9516 states have internal predecessors, (12174), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9582 states to 9582 states and 12277 transitions. [2021-11-06 21:33:28,948 INFO L78 Accepts]: Start accepts. Automaton has 9582 states and 12277 transitions. Word has length 67 [2021-11-06 21:33:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:28,948 INFO L470 AbstractCegarLoop]: Abstraction has 9582 states and 12277 transitions. [2021-11-06 21:33:28,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9582 states and 12277 transitions. [2021-11-06 21:33:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:33:28,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:28,951 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:28,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:33:28,951 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1816300095, now seen corresponding path program 1 times [2021-11-06 21:33:28,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:28,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528134943] [2021-11-06 21:33:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:28,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:29,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:29,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528134943] [2021-11-06 21:33:29,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528134943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:29,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:29,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:29,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714172561] [2021-11-06 21:33:29,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:29,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:29,251 INFO L87 Difference]: Start difference. First operand 9582 states and 12277 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:29,764 INFO L93 Difference]: Finished difference Result 9582 states and 12277 transitions. [2021-11-06 21:33:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 21:33:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:29,777 INFO L225 Difference]: With dead ends: 9582 [2021-11-06 21:33:29,777 INFO L226 Difference]: Without dead ends: 9578 [2021-11-06 21:33:29,780 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2021-11-06 21:33:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 9578. [2021-11-06 21:33:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9578 states, 9282 states have (on average 1.3111398405516053) internal successors, (12170), 9512 states have internal predecessors, (12170), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 12273 transitions. [2021-11-06 21:33:30,230 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 12273 transitions. Word has length 67 [2021-11-06 21:33:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:30,230 INFO L470 AbstractCegarLoop]: Abstraction has 9578 states and 12273 transitions. [2021-11-06 21:33:30,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 12273 transitions. [2021-11-06 21:33:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:33:30,231 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:30,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:30,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:33:30,232 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1708115971, now seen corresponding path program 1 times [2021-11-06 21:33:30,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:30,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456013563] [2021-11-06 21:33:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:30,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:30,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:30,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456013563] [2021-11-06 21:33:30,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456013563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:30,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:30,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:30,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261233379] [2021-11-06 21:33:30,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:30,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:30,451 INFO L87 Difference]: Start difference. First operand 9578 states and 12273 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:30,966 INFO L93 Difference]: Finished difference Result 9578 states and 12273 transitions. [2021-11-06 21:33:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 21:33:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:30,980 INFO L225 Difference]: With dead ends: 9578 [2021-11-06 21:33:30,981 INFO L226 Difference]: Without dead ends: 9574 [2021-11-06 21:33:30,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9574 states. [2021-11-06 21:33:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9574 to 9574. [2021-11-06 21:33:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9574 states, 9280 states have (on average 1.310991379310345) internal successors, (12166), 9508 states have internal predecessors, (12166), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (53), 50 states have call predecessors, (53), 50 states have call successors, (53) [2021-11-06 21:33:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9574 states to 9574 states and 12269 transitions. [2021-11-06 21:33:31,472 INFO L78 Accepts]: Start accepts. Automaton has 9574 states and 12269 transitions. Word has length 69 [2021-11-06 21:33:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:31,472 INFO L470 AbstractCegarLoop]: Abstraction has 9574 states and 12269 transitions. [2021-11-06 21:33:31,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9574 states and 12269 transitions. [2021-11-06 21:33:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:33:31,473 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:31,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:31,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:33:31,474 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 822388263, now seen corresponding path program 1 times [2021-11-06 21:33:31,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:31,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861803110] [2021-11-06 21:33:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:31,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:31,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:31,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861803110] [2021-11-06 21:33:31,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861803110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:31,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:31,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:31,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809323410] [2021-11-06 21:33:31,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:31,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:31,698 INFO L87 Difference]: Start difference. First operand 9574 states and 12269 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:32,678 INFO L93 Difference]: Finished difference Result 18144 states and 23331 transitions. [2021-11-06 21:33:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 21:33:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:32,710 INFO L225 Difference]: With dead ends: 18144 [2021-11-06 21:33:32,710 INFO L226 Difference]: Without dead ends: 18140 [2021-11-06 21:33:32,719 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18140 states. [2021-11-06 21:33:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18140 to 17702. [2021-11-06 21:33:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17702 states, 17345 states have (on average 1.3182473335255116) internal successors, (22865), 17573 states have internal predecessors, (22865), 91 states have call successors, (91), 42 states have call predecessors, (91), 44 states have return successors, (128), 98 states have call predecessors, (128), 91 states have call successors, (128) [2021-11-06 21:33:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17702 states to 17702 states and 23084 transitions. [2021-11-06 21:33:33,756 INFO L78 Accepts]: Start accepts. Automaton has 17702 states and 23084 transitions. Word has length 71 [2021-11-06 21:33:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:33,757 INFO L470 AbstractCegarLoop]: Abstraction has 17702 states and 23084 transitions. [2021-11-06 21:33:33,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states and 23084 transitions. [2021-11-06 21:33:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:33:33,767 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:33,767 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:33,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:33:33,768 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 41585835, now seen corresponding path program 1 times [2021-11-06 21:33:33,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:33,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766959427] [2021-11-06 21:33:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:33,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:34,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:34,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766959427] [2021-11-06 21:33:34,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766959427] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:34,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:34,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:34,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410746516] [2021-11-06 21:33:34,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:34,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:34,072 INFO L87 Difference]: Start difference. First operand 17702 states and 23084 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:34,958 INFO L93 Difference]: Finished difference Result 17702 states and 23084 transitions. [2021-11-06 21:33:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 21:33:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:35,006 INFO L225 Difference]: With dead ends: 17702 [2021-11-06 21:33:35,007 INFO L226 Difference]: Without dead ends: 17698 [2021-11-06 21:33:35,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17698 states. [2021-11-06 21:33:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17698 to 17698. [2021-11-06 21:33:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17698 states, 17343 states have (on average 1.3181687136020297) internal successors, (22861), 17569 states have internal predecessors, (22861), 91 states have call successors, (91), 42 states have call predecessors, (91), 44 states have return successors, (128), 98 states have call predecessors, (128), 91 states have call successors, (128) [2021-11-06 21:33:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 23080 transitions. [2021-11-06 21:33:36,176 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 23080 transitions. Word has length 73 [2021-11-06 21:33:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:36,176 INFO L470 AbstractCegarLoop]: Abstraction has 17698 states and 23080 transitions. [2021-11-06 21:33:36,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 23080 transitions. [2021-11-06 21:33:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 21:33:36,178 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:36,178 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:36,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:33:36,178 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1309729679, now seen corresponding path program 1 times [2021-11-06 21:33:36,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:36,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189123986] [2021-11-06 21:33:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:36,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:36,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:36,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189123986] [2021-11-06 21:33:36,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189123986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:36,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:36,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:36,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897724318] [2021-11-06 21:33:36,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:36,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:36,512 INFO L87 Difference]: Start difference. First operand 17698 states and 23080 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:38,503 INFO L93 Difference]: Finished difference Result 34392 states and 45001 transitions. [2021-11-06 21:33:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:33:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 21:33:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:38,584 INFO L225 Difference]: With dead ends: 34392 [2021-11-06 21:33:38,584 INFO L226 Difference]: Without dead ends: 34294 [2021-11-06 21:33:38,606 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34294 states. [2021-11-06 21:33:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34294 to 33850. [2021-11-06 21:33:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33850 states, 33369 states have (on average 1.3228445563247326) internal successors, (44142), 33595 states have internal predecessors, (44142), 173 states have call successors, (173), 82 states have call predecessors, (173), 88 states have return successors, (326), 194 states have call predecessors, (326), 173 states have call successors, (326) [2021-11-06 21:33:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33850 states to 33850 states and 44641 transitions. [2021-11-06 21:33:40,836 INFO L78 Accepts]: Start accepts. Automaton has 33850 states and 44641 transitions. Word has length 75 [2021-11-06 21:33:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:40,837 INFO L470 AbstractCegarLoop]: Abstraction has 33850 states and 44641 transitions. [2021-11-06 21:33:40,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 33850 states and 44641 transitions. [2021-11-06 21:33:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 21:33:40,847 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:40,847 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:40,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:33:40,847 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1116085398, now seen corresponding path program 1 times [2021-11-06 21:33:40,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:40,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174477846] [2021-11-06 21:33:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:40,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:41,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:41,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174477846] [2021-11-06 21:33:41,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174477846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:41,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:41,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:41,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978770242] [2021-11-06 21:33:41,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:41,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:41,106 INFO L87 Difference]: Start difference. First operand 33850 states and 44641 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:44,209 INFO L93 Difference]: Finished difference Result 41882 states and 55258 transitions. [2021-11-06 21:33:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-06 21:33:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:44,280 INFO L225 Difference]: With dead ends: 41882 [2021-11-06 21:33:44,280 INFO L226 Difference]: Without dead ends: 41806 [2021-11-06 21:33:44,296 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41806 states. [2021-11-06 21:33:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41806 to 33774. [2021-11-06 21:33:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33774 states, 33331 states have (on average 1.3187123098616904) internal successors, (43954), 33519 states have internal predecessors, (43954), 173 states have call successors, (173), 82 states have call predecessors, (173), 88 states have return successors, (326), 194 states have call predecessors, (326), 173 states have call successors, (326) [2021-11-06 21:33:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33774 states to 33774 states and 44453 transitions. [2021-11-06 21:33:46,928 INFO L78 Accepts]: Start accepts. Automaton has 33774 states and 44453 transitions. Word has length 85 [2021-11-06 21:33:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:46,929 INFO L470 AbstractCegarLoop]: Abstraction has 33774 states and 44453 transitions. [2021-11-06 21:33:46,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 33774 states and 44453 transitions. [2021-11-06 21:33:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 21:33:46,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:46,931 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:46,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:33:46,931 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -18438197, now seen corresponding path program 1 times [2021-11-06 21:33:46,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:46,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481768375] [2021-11-06 21:33:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:46,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:47,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:47,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481768375] [2021-11-06 21:33:47,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481768375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:47,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:47,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:33:47,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088324876] [2021-11-06 21:33:47,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:47,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:47,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:47,169 INFO L87 Difference]: Start difference. First operand 33774 states and 44453 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:53,315 INFO L93 Difference]: Finished difference Result 47856 states and 63050 transitions. [2021-11-06 21:33:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 21:33:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:53,393 INFO L225 Difference]: With dead ends: 47856 [2021-11-06 21:33:53,393 INFO L226 Difference]: Without dead ends: 47776 [2021-11-06 21:33:53,409 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47776 states. [2021-11-06 21:33:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47776 to 33694. [2021-11-06 21:33:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33694 states, 33291 states have (on average 1.3143492235138625) internal successors, (43756), 33439 states have internal predecessors, (43756), 173 states have call successors, (173), 82 states have call predecessors, (173), 88 states have return successors, (326), 194 states have call predecessors, (326), 173 states have call successors, (326) [2021-11-06 21:33:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 44255 transitions. [2021-11-06 21:33:55,750 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 44255 transitions. Word has length 92 [2021-11-06 21:33:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:55,750 INFO L470 AbstractCegarLoop]: Abstraction has 33694 states and 44255 transitions. [2021-11-06 21:33:55,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 44255 transitions. [2021-11-06 21:33:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 21:33:55,752 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:55,752 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:55,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 21:33:55,753 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting hid_suspendErr0ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:33:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 394206150, now seen corresponding path program 1 times [2021-11-06 21:33:55,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:55,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935542522] [2021-11-06 21:33:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:55,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:55,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:55,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935542522] [2021-11-06 21:33:55,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935542522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:55,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:55,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:33:55,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261351383] [2021-11-06 21:33:55,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:33:55,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:33:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:33:55,997 INFO L87 Difference]: Start difference. First operand 33694 states and 44255 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:58,773 INFO L93 Difference]: Finished difference Result 33764 states and 44336 transitions. [2021-11-06 21:33:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:33:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-06 21:33:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:58,833 INFO L225 Difference]: With dead ends: 33764 [2021-11-06 21:33:58,833 INFO L226 Difference]: Without dead ends: 33760 [2021-11-06 21:33:58,852 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:33:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33760 states. [2021-11-06 21:34:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33760 to 33690. [2021-11-06 21:34:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33690 states, 33289 states have (on average 1.3142179098200606) internal successors, (43749), 33435 states have internal predecessors, (43749), 173 states have call successors, (173), 82 states have call predecessors, (173), 88 states have return successors, (326), 194 states have call predecessors, (326), 173 states have call successors, (326) [2021-11-06 21:34:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33690 states to 33690 states and 44248 transitions. [2021-11-06 21:34:01,396 INFO L78 Accepts]: Start accepts. Automaton has 33690 states and 44248 transitions. Word has length 94 [2021-11-06 21:34:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:34:01,397 INFO L470 AbstractCegarLoop]: Abstraction has 33690 states and 44248 transitions. [2021-11-06 21:34:01,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:34:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33690 states and 44248 transitions. [2021-11-06 21:34:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 21:34:01,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:34:01,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:34:01,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:34:01,399 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr158ASSERT_VIOLATIONERROR_FUNCTION === [hid_reset_resumeErr0ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr1ASSERT_VIOLATIONERROR_FUNCTION, hid_reset_resumeErr2ASSERT_VIOLATIONERROR_FUNCTION (and 408 more)] === [2021-11-06 21:34:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:34:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1066628477, now seen corresponding path program 1 times [2021-11-06 21:34:01,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:34:01,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814725284] [2021-11-06 21:34:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:34:01,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:34:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:34:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:34:01,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:34:01,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814725284] [2021-11-06 21:34:01,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814725284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:34:01,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:34:01,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:34:01,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21730722] [2021-11-06 21:34:01,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:34:01,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:34:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:34:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:34:01,840 INFO L87 Difference]: Start difference. First operand 33690 states and 44248 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)