./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--net--ethernet--8390--pcnet_cs.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.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 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:42:35,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:42:35,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:42:35,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:42:35,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:42:35,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:42:35,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:42:35,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:42:35,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:42:35,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:42:35,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:42:35,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:42:35,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:42:35,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:42:35,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:42:35,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:42:35,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:42:35,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:42:35,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:42:35,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:42:35,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:42:35,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:42:35,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:42:35,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:42:35,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:42:35,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:42:35,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:42:35,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:42:35,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:42:35,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:42:35,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:42:35,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:42:35,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:42:35,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:42:35,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:42:35,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:42:35,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:42:35,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:42:35,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:42:35,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:42:35,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:42:35,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:42:35,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:42:35,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:42:35,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:42:35,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:42:35,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:42:35,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:42:35,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:42:35,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:42:35,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:42:35,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:42:35,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:42:35,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:42:35,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:42:35,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:42:35,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:42:35,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:42:35,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:42:35,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:42:35,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:42:35,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:42:35,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:42:35,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:42:35,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:42:35,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:42:35,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:42:35,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:42:35,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:42:35,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:42:35,538 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:42:35,538 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:42:35,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:42:35,539 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 -> 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e [2022-07-14 04:42:35,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:42:35,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:42:35,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:42:35,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:42:35,823 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:42:35,825 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--net--ethernet--8390--pcnet_cs.ko.cil.i [2022-07-14 04:42:35,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618938311/5a9231e4cdee47d89c4f7afe658ae277/FLAG27c0722e8 [2022-07-14 04:42:36,804 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:42:36,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2022-07-14 04:42:36,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618938311/5a9231e4cdee47d89c4f7afe658ae277/FLAG27c0722e8 [2022-07-14 04:42:37,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618938311/5a9231e4cdee47d89c4f7afe658ae277 [2022-07-14 04:42:37,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:42:37,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:42:37,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:42:37,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:42:37,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:42:37,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:42:37" (1/1) ... [2022-07-14 04:42:37,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7716e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:37, skipping insertion in model container [2022-07-14 04:42:37,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:42:37" (1/1) ... [2022-07-14 04:42:37,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:42:37,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:42:41,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2022-07-14 04:42:41,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2022-07-14 04:42:41,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2022-07-14 04:42:41,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2022-07-14 04:42:41,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2022-07-14 04:42:41,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2022-07-14 04:42:41,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2022-07-14 04:42:41,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2022-07-14 04:42:41,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2022-07-14 04:42:41,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2022-07-14 04:42:41,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2022-07-14 04:42:41,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2022-07-14 04:42:41,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2022-07-14 04:42:41,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2022-07-14 04:42:41,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2022-07-14 04:42:41,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2022-07-14 04:42:41,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2022-07-14 04:42:41,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2022-07-14 04:42:41,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2022-07-14 04:42:41,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2022-07-14 04:42:41,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2022-07-14 04:42:41,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2022-07-14 04:42:41,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2022-07-14 04:42:41,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2022-07-14 04:42:41,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2022-07-14 04:42:41,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2022-07-14 04:42:41,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2022-07-14 04:42:41,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2022-07-14 04:42:41,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2022-07-14 04:42:41,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2022-07-14 04:42:41,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2022-07-14 04:42:41,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2022-07-14 04:42:41,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2022-07-14 04:42:41,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2022-07-14 04:42:41,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2022-07-14 04:42:41,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2022-07-14 04:42:41,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2022-07-14 04:42:41,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2022-07-14 04:42:41,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2022-07-14 04:42:41,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2022-07-14 04:42:41,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2022-07-14 04:42:41,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2022-07-14 04:42:41,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2022-07-14 04:42:41,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2022-07-14 04:42:41,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2022-07-14 04:42:41,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2022-07-14 04:42:41,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2022-07-14 04:42:41,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2022-07-14 04:42:41,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2022-07-14 04:42:41,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2022-07-14 04:42:41,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2022-07-14 04:42:41,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2022-07-14 04:42:41,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2022-07-14 04:42:41,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2022-07-14 04:42:41,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2022-07-14 04:42:41,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2022-07-14 04:42:41,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2022-07-14 04:42:41,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2022-07-14 04:42:41,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2022-07-14 04:42:41,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2022-07-14 04:42:41,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2022-07-14 04:42:41,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2022-07-14 04:42:41,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2022-07-14 04:42:41,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2022-07-14 04:42:41,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2022-07-14 04:42:41,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2022-07-14 04:42:41,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2022-07-14 04:42:41,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2022-07-14 04:42:41,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2022-07-14 04:42:41,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2022-07-14 04:42:41,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2022-07-14 04:42:41,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2022-07-14 04:42:41,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2022-07-14 04:42:41,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2022-07-14 04:42:41,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2022-07-14 04:42:41,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2022-07-14 04:42:41,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2022-07-14 04:42:41,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2022-07-14 04:42:41,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2022-07-14 04:42:41,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2022-07-14 04:42:41,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2022-07-14 04:42:41,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2022-07-14 04:42:41,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2022-07-14 04:42:41,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2022-07-14 04:42:41,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2022-07-14 04:42:41,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2022-07-14 04:42:41,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2022-07-14 04:42:41,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2022-07-14 04:42:41,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:42:41,228 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:42:41,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2022-07-14 04:42:41,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2022-07-14 04:42:41,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2022-07-14 04:42:41,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2022-07-14 04:42:41,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2022-07-14 04:42:41,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2022-07-14 04:42:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2022-07-14 04:42:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2022-07-14 04:42:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2022-07-14 04:42:41,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2022-07-14 04:42:41,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2022-07-14 04:42:41,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2022-07-14 04:42:41,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2022-07-14 04:42:41,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2022-07-14 04:42:41,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2022-07-14 04:42:41,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2022-07-14 04:42:41,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2022-07-14 04:42:41,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2022-07-14 04:42:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2022-07-14 04:42:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2022-07-14 04:42:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2022-07-14 04:42:41,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2022-07-14 04:42:41,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2022-07-14 04:42:41,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2022-07-14 04:42:41,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2022-07-14 04:42:41,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2022-07-14 04:42:41,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2022-07-14 04:42:41,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2022-07-14 04:42:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2022-07-14 04:42:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2022-07-14 04:42:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2022-07-14 04:42:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2022-07-14 04:42:41,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2022-07-14 04:42:41,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2022-07-14 04:42:41,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2022-07-14 04:42:41,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2022-07-14 04:42:41,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2022-07-14 04:42:41,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2022-07-14 04:42:41,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2022-07-14 04:42:41,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2022-07-14 04:42:41,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2022-07-14 04:42:41,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2022-07-14 04:42:41,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2022-07-14 04:42:41,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2022-07-14 04:42:41,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2022-07-14 04:42:41,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2022-07-14 04:42:41,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2022-07-14 04:42:41,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2022-07-14 04:42:41,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2022-07-14 04:42:41,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2022-07-14 04:42:41,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2022-07-14 04:42:41,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2022-07-14 04:42:41,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2022-07-14 04:42:41,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2022-07-14 04:42:41,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2022-07-14 04:42:41,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2022-07-14 04:42:41,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2022-07-14 04:42:41,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2022-07-14 04:42:41,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2022-07-14 04:42:41,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2022-07-14 04:42:41,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2022-07-14 04:42:41,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2022-07-14 04:42:41,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2022-07-14 04:42:41,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2022-07-14 04:42:41,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2022-07-14 04:42:41,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2022-07-14 04:42:41,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2022-07-14 04:42:41,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2022-07-14 04:42:41,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2022-07-14 04:42:41,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2022-07-14 04:42:41,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2022-07-14 04:42:41,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2022-07-14 04:42:41,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2022-07-14 04:42:41,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2022-07-14 04:42:41,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2022-07-14 04:42:41,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2022-07-14 04:42:41,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2022-07-14 04:42:41,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2022-07-14 04:42:41,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2022-07-14 04:42:41,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2022-07-14 04:42:41,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2022-07-14 04:42:41,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2022-07-14 04:42:41,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2022-07-14 04:42:41,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2022-07-14 04:42:41,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2022-07-14 04:42:41,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2022-07-14 04:42:41,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2022-07-14 04:42:41,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2022-07-14 04:42:41,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:42:41,908 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:42:41,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41 WrapperNode [2022-07-14 04:42:41,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:42:41,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:42:41,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:42:41,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:42:41,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,379 INFO L137 Inliner]: procedures = 558, calls = 6257, calls flagged for inlining = 238, calls inlined = 142, statements flattened = 10827 [2022-07-14 04:42:42,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:42:42,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:42:42,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:42:42,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:42:42,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:42:42,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:42:42,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:42:42,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:42:42,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (1/1) ... [2022-07-14 04:42:42,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:42:42,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:42:42,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 04:42:42,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 04:42:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:42:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:42:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-14 04:42:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-14 04:42:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:42:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:42:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:42:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:42:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:42:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:42:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:42:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:42:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure setup_dma_config [2022-07-14 04:42:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_dma_config [2022-07-14 04:42:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:42:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:42:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:42:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:42:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:42:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:42:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:42:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:42:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:42:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure ei_poll [2022-07-14 04:42:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_poll [2022-07-14 04:42:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:42:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:42:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:42:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:42:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:42:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:42:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:42:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure set_misc_reg [2022-07-14 04:42:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure set_misc_reg [2022-07-14 04:42:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:42:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:42:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-14 04:42:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-14 04:42:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:42:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:42:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_release [2022-07-14 04:42:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_release [2022-07-14 04:42:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:42:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:42:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure NS8390_init [2022-07-14 04:42:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure NS8390_init [2022-07-14 04:42:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_map_mem_page [2022-07-14 04:42:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_map_mem_page [2022-07-14 04:42:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:42:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:42:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:42:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-07-14 04:42:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-07-14 04:42:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:42:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:42:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:42:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:42:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:42:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:42:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:42:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:42:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure outb_p [2022-07-14 04:42:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure outb_p [2022-07-14 04:42:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-14 04:42:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-14 04:42:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:42:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:42:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:42:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:42:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_detach [2022-07-14 04:42:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_detach [2022-07-14 04:42:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2022-07-14 04:42:42,990 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2022-07-14 04:42:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-14 04:42:42,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-14 04:42:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:42:42,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:42:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:42:42,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:42:42,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:42:42,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:42:42,991 INFO L130 BoogieDeclarations]: Found specification of procedure PRIV [2022-07-14 04:42:42,993 INFO L138 BoogieDeclarations]: Found implementation of procedure PRIV [2022-07-14 04:42:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_request_window [2022-07-14 04:42:42,993 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_request_window [2022-07-14 04:42:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:42:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:42:42,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:42:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:42:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-14 04:42:42,994 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-14 04:42:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-14 04:42:42,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-14 04:42:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_disable_device [2022-07-14 04:42:42,994 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_disable_device [2022-07-14 04:42:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:42:42,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:42:42,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:42:42,995 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_release_window [2022-07-14 04:42:42,995 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_release_window [2022-07-14 04:42:42,995 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 04:42:42,995 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 04:42:42,995 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-14 04:42:42,995 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-14 04:42:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:42:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:42:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_sync [2022-07-14 04:42:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_sync [2022-07-14 04:42:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:42:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:42:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:42:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:42:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure ei_tx_timeout [2022-07-14 04:42:42,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_tx_timeout [2022-07-14 04:42:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_reset_8390 [2022-07-14 04:42:42,997 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_reset_8390 [2022-07-14 04:42:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure ei_irq_wrapper [2022-07-14 04:42:42,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_irq_wrapper [2022-07-14 04:42:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_try_config [2022-07-14 04:42:42,997 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_try_config [2022-07-14 04:42:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:42:42,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:42:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:42:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:42:42,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:42:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:42:42,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:42:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:42:42,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:42:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:42:42,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:42:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:42:42,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:42:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure __readw [2022-07-14 04:42:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __readw [2022-07-14 04:42:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure __writew [2022-07-14 04:42:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __writew [2022-07-14 04:42:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-14 04:42:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-14 04:42:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure ei_set_multicast_list [2022-07-14 04:42:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_set_multicast_list [2022-07-14 04:42:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:42:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 04:42:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 04:42:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-14 04:42:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-14 04:42:43,603 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:42:43,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:42:43,788 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:43:06,938 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:43:06,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:43:06,961 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:43:06,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:43:06 BoogieIcfgContainer [2022-07-14 04:43:06,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:43:06,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:43:06,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:43:06,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:43:06,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:42:37" (1/3) ... [2022-07-14 04:43:06,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a1196d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:43:06, skipping insertion in model container [2022-07-14 04:43:06,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:42:41" (2/3) ... [2022-07-14 04:43:06,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a1196d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:43:06, skipping insertion in model container [2022-07-14 04:43:06,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:43:06" (3/3) ... [2022-07-14 04:43:06,973 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2022-07-14 04:43:06,985 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:43:06,986 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-07-14 04:43:07,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:43:07,081 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fa6c121, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@163f0f06 [2022-07-14 04:43:07,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-07-14 04:43:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 1072 states, 732 states have (on average 1.3005464480874316) internal successors, (952), 770 states have internal predecessors, (952), 251 states have call successors, (251), 67 states have call predecessors, (251), 66 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2022-07-14 04:43:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:43:07,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:07,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:43:07,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:43:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2075280253, now seen corresponding path program 1 times [2022-07-14 04:43:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280154235] [2022-07-14 04:43:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:43:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:43:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:43:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:43:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:43:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:43:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:43:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:43:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:11,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280154235] [2022-07-14 04:43:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280154235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:11,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:11,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991459391] [2022-07-14 04:43:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:11,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:11,498 INFO L87 Difference]: Start difference. First operand has 1072 states, 732 states have (on average 1.3005464480874316) internal successors, (952), 770 states have internal predecessors, (952), 251 states have call successors, (251), 67 states have call predecessors, (251), 66 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:43:13,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:16,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:20,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:23,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:25,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:35,519 INFO L93 Difference]: Finished difference Result 3150 states and 4407 transitions. [2022-07-14 04:43:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:43:35,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-14 04:43:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:35,553 INFO L225 Difference]: With dead ends: 3150 [2022-07-14 04:43:35,553 INFO L226 Difference]: Without dead ends: 2079 [2022-07-14 04:43:35,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:43:35,570 INFO L413 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 2834 mSolverCounterSat, 1496 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3198 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 4335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1496 IncrementalHoareTripleChecker+Valid, 2834 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:35,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3198 Valid, 3458 Invalid, 4335 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1496 Valid, 2834 Invalid, 5 Unknown, 0 Unchecked, 23.2s Time] [2022-07-14 04:43:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2022-07-14 04:43:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1898. [2022-07-14 04:43:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1322 states have (on average 1.2526475037821483) internal successors, (1656), 1371 states have internal predecessors, (1656), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:43:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2549 transitions. [2022-07-14 04:43:35,735 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2549 transitions. Word has length 64 [2022-07-14 04:43:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:35,737 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 2549 transitions. [2022-07-14 04:43:35,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:43:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2549 transitions. [2022-07-14 04:43:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:43:35,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:35,746 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:43:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:43:35,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:43:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2039495394, now seen corresponding path program 1 times [2022-07-14 04:43:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:35,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960140360] [2022-07-14 04:43:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:43:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:43:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:43:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:43:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:43:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:43:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:43:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:43:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:38,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960140360] [2022-07-14 04:43:38,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960140360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:38,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:38,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706118358] [2022-07-14 04:43:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:38,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:38,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:38,359 INFO L87 Difference]: Start difference. First operand 1898 states and 2549 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:43:40,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:42,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:47,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:52,183 INFO L93 Difference]: Finished difference Result 1898 states and 2549 transitions. [2022-07-14 04:43:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:43:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-14 04:43:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:52,195 INFO L225 Difference]: With dead ends: 1898 [2022-07-14 04:43:52,195 INFO L226 Difference]: Without dead ends: 1896 [2022-07-14 04:43:52,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:43:52,197 INFO L413 NwaCegarLoop]: 1297 mSDtfsCounter, 2083 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:52,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 2573 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1262 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2022-07-14 04:43:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-07-14 04:43:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2022-07-14 04:43:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1321 states have (on average 1.2520817562452686) internal successors, (1654), 1369 states have internal predecessors, (1654), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:43:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2547 transitions. [2022-07-14 04:43:52,265 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2547 transitions. Word has length 70 [2022-07-14 04:43:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:52,267 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2547 transitions. [2022-07-14 04:43:52,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:43:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2547 transitions. [2022-07-14 04:43:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:43:52,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:52,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:43:52,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:43:52,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:43:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1811031801, now seen corresponding path program 1 times [2022-07-14 04:43:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:52,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815283607] [2022-07-14 04:43:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:43:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:43:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:43:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:43:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:43:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:43:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:43:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:43:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:43:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:43:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815283607] [2022-07-14 04:43:54,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815283607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:54,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:54,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108536830] [2022-07-14 04:43:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:54,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:54,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:54,694 INFO L87 Difference]: Start difference. First operand 1896 states and 2547 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:43:56,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:59,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:03,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:07,442 INFO L93 Difference]: Finished difference Result 1896 states and 2547 transitions. [2022-07-14 04:44:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-14 04:44:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:07,453 INFO L225 Difference]: With dead ends: 1896 [2022-07-14 04:44:07,453 INFO L226 Difference]: Without dead ends: 1894 [2022-07-14 04:44:07,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:44:07,455 INFO L413 NwaCegarLoop]: 1295 mSDtfsCounter, 2077 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:07,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 2571 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1260 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2022-07-14 04:44:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2022-07-14 04:44:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2022-07-14 04:44:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1320 states have (on average 1.2515151515151515) internal successors, (1652), 1367 states have internal predecessors, (1652), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:44:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2545 transitions. [2022-07-14 04:44:07,520 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2545 transitions. Word has length 76 [2022-07-14 04:44:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:07,521 INFO L495 AbstractCegarLoop]: Abstraction has 1894 states and 2545 transitions. [2022-07-14 04:44:07,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:44:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2545 transitions. [2022-07-14 04:44:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:44:07,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:07,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:44:07,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:44:07,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:44:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1733630626, now seen corresponding path program 1 times [2022-07-14 04:44:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:07,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674158232] [2022-07-14 04:44:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:44:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:10,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674158232] [2022-07-14 04:44:10,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674158232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:10,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:10,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086030871] [2022-07-14 04:44:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:10,071 INFO L87 Difference]: Start difference. First operand 1894 states and 2545 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:44:12,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:14,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:18,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:22,437 INFO L93 Difference]: Finished difference Result 1894 states and 2545 transitions. [2022-07-14 04:44:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-14 04:44:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:22,447 INFO L225 Difference]: With dead ends: 1894 [2022-07-14 04:44:22,447 INFO L226 Difference]: Without dead ends: 1892 [2022-07-14 04:44:22,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:44:22,450 INFO L413 NwaCegarLoop]: 1293 mSDtfsCounter, 2071 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:22,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 2569 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1258 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-07-14 04:44:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-07-14 04:44:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1892. [2022-07-14 04:44:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1319 states have (on average 1.2509476876421532) internal successors, (1650), 1365 states have internal predecessors, (1650), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:44:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2543 transitions. [2022-07-14 04:44:22,525 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2543 transitions. Word has length 82 [2022-07-14 04:44:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:22,526 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2543 transitions. [2022-07-14 04:44:22,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:44:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2543 transitions. [2022-07-14 04:44:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:44:22,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:22,527 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:44:22,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:44:22,528 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:44:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash 152828223, now seen corresponding path program 1 times [2022-07-14 04:44:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:22,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627188639] [2022-07-14 04:44:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:44:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:44:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:24,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627188639] [2022-07-14 04:44:24,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627188639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:24,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406366415] [2022-07-14 04:44:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:24,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:24,903 INFO L87 Difference]: Start difference. First operand 1892 states and 2543 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:44:27,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:29,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:33,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:37,159 INFO L93 Difference]: Finished difference Result 1892 states and 2543 transitions. [2022-07-14 04:44:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-14 04:44:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:37,169 INFO L225 Difference]: With dead ends: 1892 [2022-07-14 04:44:37,169 INFO L226 Difference]: Without dead ends: 1890 [2022-07-14 04:44:37,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:44:37,171 INFO L413 NwaCegarLoop]: 1291 mSDtfsCounter, 2065 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:37,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 2567 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1256 Invalid, 3 Unknown, 0 Unchecked, 11.9s Time] [2022-07-14 04:44:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-07-14 04:44:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2022-07-14 04:44:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1318 states have (on average 1.2503793626707131) internal successors, (1648), 1363 states have internal predecessors, (1648), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:44:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2541 transitions. [2022-07-14 04:44:37,239 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2541 transitions. Word has length 88 [2022-07-14 04:44:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:37,239 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2541 transitions. [2022-07-14 04:44:37,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:44:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2541 transitions. [2022-07-14 04:44:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:44:37,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:37,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:44:37,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:44:37,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:44:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1276185814, now seen corresponding path program 1 times [2022-07-14 04:44:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:37,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009002451] [2022-07-14 04:44:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:44:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:44:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:44:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:39,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009002451] [2022-07-14 04:44:39,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009002451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:39,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:39,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425380371] [2022-07-14 04:44:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:39,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:39,399 INFO L87 Difference]: Start difference. First operand 1890 states and 2541 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:44:41,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:43,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:48,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:44:51,714 INFO L93 Difference]: Finished difference Result 1890 states and 2541 transitions. [2022-07-14 04:44:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:44:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-14 04:44:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:44:51,724 INFO L225 Difference]: With dead ends: 1890 [2022-07-14 04:44:51,724 INFO L226 Difference]: Without dead ends: 1888 [2022-07-14 04:44:51,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:44:51,726 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 2059 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:44:51,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2565 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1254 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-07-14 04:44:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-07-14 04:44:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2022-07-14 04:44:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1317 states have (on average 1.2498101746393318) internal successors, (1646), 1361 states have internal predecessors, (1646), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:44:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2539 transitions. [2022-07-14 04:44:51,807 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2539 transitions. Word has length 94 [2022-07-14 04:44:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:44:51,808 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2539 transitions. [2022-07-14 04:44:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:44:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2539 transitions. [2022-07-14 04:44:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:44:51,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:51,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:44:51,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:44:51,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:44:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1073764556, now seen corresponding path program 1 times [2022-07-14 04:44:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:51,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11938081] [2022-07-14 04:44:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:44:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:44:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:44:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:44:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:44:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:44:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:44:53,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:53,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11938081] [2022-07-14 04:44:53,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11938081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:53,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:53,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:53,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946128472] [2022-07-14 04:44:53,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:53,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:53,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:53,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:53,945 INFO L87 Difference]: Start difference. First operand 1888 states and 2539 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:44:56,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:58,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:02,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:06,242 INFO L93 Difference]: Finished difference Result 1888 states and 2539 transitions. [2022-07-14 04:45:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-14 04:45:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:06,252 INFO L225 Difference]: With dead ends: 1888 [2022-07-14 04:45:06,252 INFO L226 Difference]: Without dead ends: 1886 [2022-07-14 04:45:06,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:06,255 INFO L413 NwaCegarLoop]: 1287 mSDtfsCounter, 2053 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:06,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2563 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1252 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-07-14 04:45:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-07-14 04:45:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2022-07-14 04:45:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1316 states have (on average 1.249240121580547) internal successors, (1644), 1359 states have internal predecessors, (1644), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:45:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2537 transitions. [2022-07-14 04:45:06,333 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2537 transitions. Word has length 100 [2022-07-14 04:45:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:06,333 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 2537 transitions. [2022-07-14 04:45:06,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:45:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2537 transitions. [2022-07-14 04:45:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:45:06,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:06,335 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:06,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:45:06,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:45:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1526092476, now seen corresponding path program 1 times [2022-07-14 04:45:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:06,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118866957] [2022-07-14 04:45:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:08,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118866957] [2022-07-14 04:45:08,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118866957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:08,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:08,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494999116] [2022-07-14 04:45:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:08,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:08,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:08,484 INFO L87 Difference]: Start difference. First operand 1886 states and 2537 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:45:10,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:13,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:17,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:20,733 INFO L93 Difference]: Finished difference Result 1886 states and 2537 transitions. [2022-07-14 04:45:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-14 04:45:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:20,741 INFO L225 Difference]: With dead ends: 1886 [2022-07-14 04:45:20,741 INFO L226 Difference]: Without dead ends: 1884 [2022-07-14 04:45:20,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:20,742 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 2051 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:20,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2561 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1246 Invalid, 3 Unknown, 0 Unchecked, 11.9s Time] [2022-07-14 04:45:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-07-14 04:45:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2022-07-14 04:45:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1315 states have (on average 1.2486692015209127) internal successors, (1642), 1357 states have internal predecessors, (1642), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:45:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2535 transitions. [2022-07-14 04:45:20,817 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2535 transitions. Word has length 106 [2022-07-14 04:45:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:20,818 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2535 transitions. [2022-07-14 04:45:20,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:45:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2535 transitions. [2022-07-14 04:45:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:45:20,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:20,820 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:20,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:45:20,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:45:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1991172703, now seen corresponding path program 1 times [2022-07-14 04:45:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:20,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735323555] [2022-07-14 04:45:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:22,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735323555] [2022-07-14 04:45:22,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735323555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:22,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:22,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336627375] [2022-07-14 04:45:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:22,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:22,917 INFO L87 Difference]: Start difference. First operand 1884 states and 2535 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:45:25,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:27,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:31,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:35,055 INFO L93 Difference]: Finished difference Result 1884 states and 2535 transitions. [2022-07-14 04:45:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:35,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-14 04:45:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:35,062 INFO L225 Difference]: With dead ends: 1884 [2022-07-14 04:45:35,062 INFO L226 Difference]: Without dead ends: 1882 [2022-07-14 04:45:35,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:35,064 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 2039 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:35,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2559 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1248 Invalid, 3 Unknown, 0 Unchecked, 11.8s Time] [2022-07-14 04:45:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-14 04:45:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-07-14 04:45:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1314 states have (on average 1.248097412480974) internal successors, (1640), 1355 states have internal predecessors, (1640), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:45:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2533 transitions. [2022-07-14 04:45:35,139 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2533 transitions. Word has length 108 [2022-07-14 04:45:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:35,139 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2533 transitions. [2022-07-14 04:45:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:45:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2533 transitions. [2022-07-14 04:45:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:45:35,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:35,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:35,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:45:35,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:45:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash 282489382, now seen corresponding path program 1 times [2022-07-14 04:45:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:35,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128957595] [2022-07-14 04:45:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128957595] [2022-07-14 04:45:37,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128957595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:37,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:37,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017493272] [2022-07-14 04:45:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:37,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:37,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:37,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:37,104 INFO L87 Difference]: Start difference. First operand 1882 states and 2533 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:45:39,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:41,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:45,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:49,521 INFO L93 Difference]: Finished difference Result 1882 states and 2533 transitions. [2022-07-14 04:45:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:49,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-14 04:45:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:49,528 INFO L225 Difference]: With dead ends: 1882 [2022-07-14 04:45:49,528 INFO L226 Difference]: Without dead ends: 1880 [2022-07-14 04:45:49,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:49,531 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 2035 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:49,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 2557 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1246 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2022-07-14 04:45:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-14 04:45:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-07-14 04:45:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1313 states have (on average 1.2475247524752475) internal successors, (1638), 1353 states have internal predecessors, (1638), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:45:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2531 transitions. [2022-07-14 04:45:49,612 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2531 transitions. Word has length 114 [2022-07-14 04:45:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:49,613 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2531 transitions. [2022-07-14 04:45:49,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:45:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2531 transitions. [2022-07-14 04:45:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:45:49,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:49,616 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:49,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:45:49,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:45:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 406054183, now seen corresponding path program 1 times [2022-07-14 04:45:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:49,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540087441] [2022-07-14 04:45:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:45:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:45:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:45:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:45:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:45:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:51,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540087441] [2022-07-14 04:45:51,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540087441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:51,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:51,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948803523] [2022-07-14 04:45:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:51,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:51,814 INFO L87 Difference]: Start difference. First operand 1880 states and 2531 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:45:54,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:56,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:00,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:04,414 INFO L93 Difference]: Finished difference Result 1880 states and 2531 transitions. [2022-07-14 04:46:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-14 04:46:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:04,423 INFO L225 Difference]: With dead ends: 1880 [2022-07-14 04:46:04,423 INFO L226 Difference]: Without dead ends: 1878 [2022-07-14 04:46:04,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:04,425 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 2029 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:04,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2555 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1244 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2022-07-14 04:46:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-07-14 04:46:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-07-14 04:46:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1312 states have (on average 1.2469512195121952) internal successors, (1636), 1351 states have internal predecessors, (1636), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:46:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2529 transitions. [2022-07-14 04:46:04,511 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2529 transitions. Word has length 120 [2022-07-14 04:46:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:04,512 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2529 transitions. [2022-07-14 04:46:04,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:46:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2529 transitions. [2022-07-14 04:46:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:46:04,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:04,514 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:04,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:46:04,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:46:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1446133040, now seen corresponding path program 1 times [2022-07-14 04:46:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:04,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633582698] [2022-07-14 04:46:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:06,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633582698] [2022-07-14 04:46:06,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633582698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:06,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:06,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28252072] [2022-07-14 04:46:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:06,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:06,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:06,584 INFO L87 Difference]: Start difference. First operand 1878 states and 2529 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:46:08,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:11,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:15,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:19,238 INFO L93 Difference]: Finished difference Result 1878 states and 2529 transitions. [2022-07-14 04:46:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-14 04:46:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:19,248 INFO L225 Difference]: With dead ends: 1878 [2022-07-14 04:46:19,248 INFO L226 Difference]: Without dead ends: 1876 [2022-07-14 04:46:19,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:19,250 INFO L413 NwaCegarLoop]: 1277 mSDtfsCounter, 2023 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:19,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2553 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1242 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2022-07-14 04:46:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-07-14 04:46:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2022-07-14 04:46:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1311 states have (on average 1.2463768115942029) internal successors, (1634), 1349 states have internal predecessors, (1634), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:46:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2527 transitions. [2022-07-14 04:46:19,334 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2527 transitions. Word has length 126 [2022-07-14 04:46:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:19,334 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2527 transitions. [2022-07-14 04:46:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:46:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2527 transitions. [2022-07-14 04:46:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:46:19,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:19,337 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:19,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:46:19,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:46:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 933821385, now seen corresponding path program 1 times [2022-07-14 04:46:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:19,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786142341] [2022-07-14 04:46:19,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:46:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:21,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786142341] [2022-07-14 04:46:21,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786142341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:21,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:21,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685133761] [2022-07-14 04:46:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:21,449 INFO L87 Difference]: Start difference. First operand 1876 states and 2527 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:46:23,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:26,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:30,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:33,963 INFO L93 Difference]: Finished difference Result 1876 states and 2527 transitions. [2022-07-14 04:46:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:33,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-14 04:46:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:33,973 INFO L225 Difference]: With dead ends: 1876 [2022-07-14 04:46:33,973 INFO L226 Difference]: Without dead ends: 1874 [2022-07-14 04:46:33,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:33,976 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 2017 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:33,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2551 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1240 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2022-07-14 04:46:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-07-14 04:46:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2022-07-14 04:46:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1310 states have (on average 1.2458015267175573) internal successors, (1632), 1347 states have internal predecessors, (1632), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2022-07-14 04:46:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2525 transitions. [2022-07-14 04:46:34,059 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2525 transitions. Word has length 132 [2022-07-14 04:46:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:34,059 INFO L495 AbstractCegarLoop]: Abstraction has 1874 states and 2525 transitions. [2022-07-14 04:46:34,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:46:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2525 transitions. [2022-07-14 04:46:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:46:34,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:34,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:46:34,062 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-07-14 04:46:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2020752218, now seen corresponding path program 1 times [2022-07-14 04:46:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567846083] [2022-07-14 04:46:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:46:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:46:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567846083] [2022-07-14 04:46:35,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567846083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:35,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:35,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584438886] [2022-07-14 04:46:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:36,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:36,000 INFO L87 Difference]: Start difference. First operand 1874 states and 2525 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)