./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--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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--vme--bridges--vme_ca91cx42.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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:12:03,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:12:03,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:12:03,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:12:03,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:12:03,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:12:03,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:12:03,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:12:03,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:12:03,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:12:03,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:12:03,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:12:03,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:12:03,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:12:03,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:12:03,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:12:03,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:12:03,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:12:03,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:12:03,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:12:03,417 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:12:03,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:12:03,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:12:03,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:12:03,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:12:03,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:12:03,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:12:03,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:12:03,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:12:03,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:12:03,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:12:03,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:12:03,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:12:03,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:12:03,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:12:03,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:12:03,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:12:03,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:12:03,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:12:03,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:12:03,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:12:03,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:12:03,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:12:03,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:12:03,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:12:03,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:12:03,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:12:03,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:12:03,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:12:03,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:12:03,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:12:03,482 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:12:03,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:12:03,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:12:03,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:12:03,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:12:03,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:12:03,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:12:03,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:12:03,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:12:03,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:12:03,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:12:03,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:12:03,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:12:03,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:12:03,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:12:03,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:12:03,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:12:03,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:12:03,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:12:03,487 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:12:03,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:12:03,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:12:03,488 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2022-07-12 17:12:03,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:12:03,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:12:03,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:12:03,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:12:03,740 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:12:03,741 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--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-12 17:12:03,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ef47de6/7e8fa68af0964058a3e804b2d1bf5743/FLAG7117ab4b2 [2022-07-12 17:12:04,575 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:12:04,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-12 17:12:04,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ef47de6/7e8fa68af0964058a3e804b2d1bf5743/FLAG7117ab4b2 [2022-07-12 17:12:04,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ef47de6/7e8fa68af0964058a3e804b2d1bf5743 [2022-07-12 17:12:04,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:12:04,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:12:04,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:12:04,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:12:04,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:12:04,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:12:04" (1/1) ... [2022-07-12 17:12:04,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f75ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:04, skipping insertion in model container [2022-07-12 17:12:04,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:12:04" (1/1) ... [2022-07-12 17:12:04,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:12:04,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:12:07,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2022-07-12 17:12:07,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2022-07-12 17:12:07,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2022-07-12 17:12:07,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2022-07-12 17:12:07,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2022-07-12 17:12:07,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2022-07-12 17:12:07,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2022-07-12 17:12:07,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2022-07-12 17:12:07,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2022-07-12 17:12:07,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2022-07-12 17:12:07,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2022-07-12 17:12:07,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2022-07-12 17:12:07,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2022-07-12 17:12:07,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2022-07-12 17:12:07,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2022-07-12 17:12:07,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2022-07-12 17:12:07,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2022-07-12 17:12:07,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2022-07-12 17:12:07,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2022-07-12 17:12:07,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2022-07-12 17:12:07,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2022-07-12 17:12:07,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2022-07-12 17:12:07,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2022-07-12 17:12:07,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2022-07-12 17:12:07,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2022-07-12 17:12:07,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2022-07-12 17:12:07,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2022-07-12 17:12:07,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2022-07-12 17:12:07,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2022-07-12 17:12:07,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2022-07-12 17:12:07,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2022-07-12 17:12:07,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2022-07-12 17:12:07,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2022-07-12 17:12:07,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2022-07-12 17:12:07,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2022-07-12 17:12:07,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2022-07-12 17:12:07,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2022-07-12 17:12:07,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2022-07-12 17:12:07,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2022-07-12 17:12:07,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2022-07-12 17:12:07,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2022-07-12 17:12:07,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2022-07-12 17:12:07,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2022-07-12 17:12:07,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2022-07-12 17:12:07,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2022-07-12 17:12:07,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2022-07-12 17:12:07,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2022-07-12 17:12:07,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2022-07-12 17:12:07,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2022-07-12 17:12:07,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2022-07-12 17:12:07,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2022-07-12 17:12:07,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2022-07-12 17:12:07,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2022-07-12 17:12:07,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2022-07-12 17:12:07,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2022-07-12 17:12:07,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2022-07-12 17:12:07,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2022-07-12 17:12:07,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2022-07-12 17:12:07,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2022-07-12 17:12:07,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2022-07-12 17:12:07,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2022-07-12 17:12:07,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2022-07-12 17:12:07,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2022-07-12 17:12:07,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2022-07-12 17:12:07,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2022-07-12 17:12:07,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2022-07-12 17:12:07,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2022-07-12 17:12:07,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2022-07-12 17:12:07,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2022-07-12 17:12:07,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2022-07-12 17:12:07,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2022-07-12 17:12:07,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2022-07-12 17:12:07,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2022-07-12 17:12:07,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2022-07-12 17:12:07,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2022-07-12 17:12:07,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2022-07-12 17:12:07,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2022-07-12 17:12:07,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2022-07-12 17:12:07,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2022-07-12 17:12:07,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2022-07-12 17:12:07,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2022-07-12 17:12:07,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2022-07-12 17:12:07,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2022-07-12 17:12:07,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2022-07-12 17:12:07,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2022-07-12 17:12:07,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2022-07-12 17:12:07,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2022-07-12 17:12:07,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2022-07-12 17:12:07,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:12:07,591 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:12:07,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2022-07-12 17:12:07,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2022-07-12 17:12:07,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2022-07-12 17:12:07,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2022-07-12 17:12:07,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2022-07-12 17:12:07,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2022-07-12 17:12:07,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2022-07-12 17:12:07,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2022-07-12 17:12:07,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2022-07-12 17:12:07,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2022-07-12 17:12:07,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2022-07-12 17:12:07,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2022-07-12 17:12:07,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2022-07-12 17:12:07,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2022-07-12 17:12:07,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2022-07-12 17:12:07,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2022-07-12 17:12:07,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2022-07-12 17:12:07,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2022-07-12 17:12:07,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2022-07-12 17:12:07,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2022-07-12 17:12:07,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2022-07-12 17:12:07,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2022-07-12 17:12:07,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2022-07-12 17:12:07,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2022-07-12 17:12:07,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2022-07-12 17:12:07,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2022-07-12 17:12:07,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2022-07-12 17:12:07,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2022-07-12 17:12:07,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2022-07-12 17:12:07,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2022-07-12 17:12:07,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2022-07-12 17:12:07,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2022-07-12 17:12:07,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2022-07-12 17:12:07,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2022-07-12 17:12:07,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2022-07-12 17:12:07,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2022-07-12 17:12:07,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2022-07-12 17:12:07,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2022-07-12 17:12:07,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2022-07-12 17:12:07,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2022-07-12 17:12:07,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2022-07-12 17:12:07,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2022-07-12 17:12:07,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2022-07-12 17:12:07,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2022-07-12 17:12:07,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2022-07-12 17:12:07,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2022-07-12 17:12:07,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2022-07-12 17:12:07,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2022-07-12 17:12:07,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2022-07-12 17:12:07,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2022-07-12 17:12:07,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2022-07-12 17:12:07,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2022-07-12 17:12:07,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2022-07-12 17:12:07,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2022-07-12 17:12:07,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2022-07-12 17:12:07,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2022-07-12 17:12:07,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2022-07-12 17:12:07,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2022-07-12 17:12:07,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2022-07-12 17:12:07,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2022-07-12 17:12:07,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2022-07-12 17:12:07,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2022-07-12 17:12:07,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2022-07-12 17:12:07,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2022-07-12 17:12:07,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2022-07-12 17:12:07,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2022-07-12 17:12:07,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2022-07-12 17:12:07,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2022-07-12 17:12:07,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2022-07-12 17:12:07,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2022-07-12 17:12:07,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2022-07-12 17:12:07,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2022-07-12 17:12:07,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2022-07-12 17:12:07,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2022-07-12 17:12:07,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2022-07-12 17:12:07,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2022-07-12 17:12:07,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2022-07-12 17:12:07,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2022-07-12 17:12:07,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2022-07-12 17:12:07,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2022-07-12 17:12:07,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2022-07-12 17:12:07,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2022-07-12 17:12:07,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2022-07-12 17:12:07,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2022-07-12 17:12:07,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2022-07-12 17:12:07,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2022-07-12 17:12:07,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2022-07-12 17:12:07,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2022-07-12 17:12:07,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:12:08,101 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:12:08,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08 WrapperNode [2022-07-12 17:12:08,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:12:08,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:12:08,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:12:08,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:12:08,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,337 INFO L137 Inliner]: procedures = 571, calls = 1726, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2543 [2022-07-12 17:12:08,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:12:08,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:12:08,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:12:08,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:12:08,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:12:08,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:12:08,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:12:08,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:12:08,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (1/1) ... [2022-07-12 17:12:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:12:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:08,509 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-12 17:12:08,532 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-12 17:12:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:12:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:12:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-12 17:12:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-12 17:12:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 17:12:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 17:12:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:12:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:12:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-12 17:12:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-12 17:12:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:12:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:12:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-12 17:12:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-12 17:12:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:12:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:12:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:12:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:12:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2022-07-12 17:12:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2022-07-12 17:12:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:12:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:12:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2022-07-12 17:12:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2022-07-12 17:12:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:12:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:12:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:12:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:12:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:12:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 17:12:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 17:12:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 17:12:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 17:12:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:12:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:12:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2022-07-12 17:12:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2022-07-12 17:12:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-12 17:12:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-12 17:12:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 17:12:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 17:12:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:12:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:12:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:12:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:12:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:12:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:12:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:12:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:12:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:12:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:12:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:12:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:12:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:12:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:12:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 17:12:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 17:12:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:12:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:12:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-12 17:12:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-12 17:12:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 17:12:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 17:12:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-12 17:12:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-12 17:12:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:12:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:12:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-12 17:12:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-12 17:12:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:12:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:12:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2022-07-12 17:12:08,568 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2022-07-12 17:12:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:12:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-12 17:12:08,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-12 17:12:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:12:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:12:08,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:12:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:12:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:12:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:12:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:12:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:12:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2022-07-12 17:12:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2022-07-12 17:12:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:12:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:12:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 17:12:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 17:12:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-12 17:12:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-12 17:12:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:12:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:12:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:12:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:12:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 17:12:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 17:12:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:12:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:12:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:12:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:12:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:12:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:12:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:12:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:12:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:12:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:12:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2022-07-12 17:12:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 17:12:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 17:12:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 17:12:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 17:12:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 17:12:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:12:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:12:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:12:08,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:12:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2022-07-12 17:12:08,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2022-07-12 17:12:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 17:12:08,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 17:12:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:12:08,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:12:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:12:08,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:12:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:12:08,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:12:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2022-07-12 17:12:08,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2022-07-12 17:12:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:12:08,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:12:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:12:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:12:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:12:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:12:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:12:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2022-07-12 17:12:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2022-07-12 17:12:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:12:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:12:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:12:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:12:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:12:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:12:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 17:12:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 17:12:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:12:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:12:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:12:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:12:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2022-07-12 17:12:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2022-07-12 17:12:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:12:09,105 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:12:09,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:12:09,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:12:11,498 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:12:11,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:12:11,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 17:12:11,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:12:11 BoogieIcfgContainer [2022-07-12 17:12:11,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:12:11,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:12:11,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:12:11,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:12:11,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:12:04" (1/3) ... [2022-07-12 17:12:11,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5965cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:12:11, skipping insertion in model container [2022-07-12 17:12:11,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:08" (2/3) ... [2022-07-12 17:12:11,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5965cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:12:11, skipping insertion in model container [2022-07-12 17:12:11,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:12:11" (3/3) ... [2022-07-12 17:12:11,533 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-12 17:12:11,549 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:12:11,549 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-12 17:12:11,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:12:11,645 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@cbba93b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d657c75 [2022-07-12 17:12:11,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-12 17:12:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 1033 states, 682 states have (on average 1.312316715542522) internal successors, (895), 723 states have internal predecessors, (895), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) [2022-07-12 17:12:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 17:12:11,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:11,664 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-12 17:12:11,664 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 26 more)] === [2022-07-12 17:12:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -103879935, now seen corresponding path program 1 times [2022-07-12 17:12:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883604073] [2022-07-12 17:12:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,365 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-12 17:12:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883604073] [2022-07-12 17:12:12,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883604073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:12,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:12,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:12,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366402951] [2022-07-12 17:12:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:12,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:12,416 INFO L87 Difference]: Start difference. First operand has 1033 states, 682 states have (on average 1.312316715542522) internal successors, (895), 723 states have internal predecessors, (895), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 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-12 17:12:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:16,092 INFO L93 Difference]: Finished difference Result 3027 states and 4220 transitions. [2022-07-12 17:12:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:12:16,098 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-12 17:12:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:16,127 INFO L225 Difference]: With dead ends: 3027 [2022-07-12 17:12:16,128 INFO L226 Difference]: Without dead ends: 2000 [2022-07-12 17:12:16,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:12:16,145 INFO L413 NwaCegarLoop]: 1608 mSDtfsCounter, 2622 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 1418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 4052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:16,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2761 Valid, 3934 Invalid, 4052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1418 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 17:12:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2022-07-12 17:12:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1807. [2022-07-12 17:12:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1215 states have (on average 1.242798353909465) internal successors, (1510), 1270 states have internal predecessors, (1510), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2395 transitions. [2022-07-12 17:12:16,334 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2395 transitions. Word has length 64 [2022-07-12 17:12:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:16,335 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 2395 transitions. [2022-07-12 17:12:16,335 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-12 17:12:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2395 transitions. [2022-07-12 17:12:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 17:12:16,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:16,339 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-12 17:12:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:12:16,339 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 26 more)] === [2022-07-12 17:12:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 447709296, now seen corresponding path program 1 times [2022-07-12 17:12:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147347527] [2022-07-12 17:12:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:16,531 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-12 17:12:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147347527] [2022-07-12 17:12:16,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147347527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:16,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:16,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507634492] [2022-07-12 17:12:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:16,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:16,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:16,536 INFO L87 Difference]: Start difference. First operand 1807 states and 2395 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-12 17:12:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:18,236 INFO L93 Difference]: Finished difference Result 1807 states and 2395 transitions. [2022-07-12 17:12:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:18,237 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-12 17:12:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:18,252 INFO L225 Difference]: With dead ends: 1807 [2022-07-12 17:12:18,253 INFO L226 Difference]: Without dead ends: 1805 [2022-07-12 17:12:18,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:18,257 INFO L413 NwaCegarLoop]: 1223 mSDtfsCounter, 1819 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:18,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1959 Valid, 2565 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:12:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-12 17:12:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2022-07-12 17:12:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1214 states have (on average 1.242174629324547) internal successors, (1508), 1268 states have internal predecessors, (1508), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2393 transitions. [2022-07-12 17:12:18,357 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2393 transitions. Word has length 70 [2022-07-12 17:12:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:18,359 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 2393 transitions. [2022-07-12 17:12:18,359 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-12 17:12:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2393 transitions. [2022-07-12 17:12:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 17:12:18,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:18,367 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-12 17:12:18,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:12:18,367 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 26 more)] === [2022-07-12 17:12:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1019159084, now seen corresponding path program 1 times [2022-07-12 17:12:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:18,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261192126] [2022-07-12 17:12:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:18,617 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-12 17:12:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261192126] [2022-07-12 17:12:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261192126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545486527] [2022-07-12 17:12:18,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:18,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:18,620 INFO L87 Difference]: Start difference. First operand 1805 states and 2393 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-12 17:12:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:20,292 INFO L93 Difference]: Finished difference Result 1805 states and 2393 transitions. [2022-07-12 17:12:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:20,293 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-12 17:12:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:20,303 INFO L225 Difference]: With dead ends: 1805 [2022-07-12 17:12:20,304 INFO L226 Difference]: Without dead ends: 1803 [2022-07-12 17:12:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:20,306 INFO L413 NwaCegarLoop]: 1221 mSDtfsCounter, 1813 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:20,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 2563 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:12:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-12 17:12:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2022-07-12 17:12:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1213 states have (on average 1.2415498763396537) internal successors, (1506), 1266 states have internal predecessors, (1506), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2391 transitions. [2022-07-12 17:12:20,389 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2391 transitions. Word has length 76 [2022-07-12 17:12:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:20,389 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2391 transitions. [2022-07-12 17:12:20,389 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-12 17:12:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2391 transitions. [2022-07-12 17:12:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 17:12:20,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:20,392 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-12 17:12:20,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:12:20,392 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 26 more)] === [2022-07-12 17:12:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1787508714, now seen corresponding path program 1 times [2022-07-12 17:12:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:20,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173776734] [2022-07-12 17:12:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:12:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:20,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173776734] [2022-07-12 17:12:20,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173776734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:20,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:20,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003683049] [2022-07-12 17:12:20,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:20,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:20,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:20,640 INFO L87 Difference]: Start difference. First operand 1803 states and 2391 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-12 17:12:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:22,289 INFO L93 Difference]: Finished difference Result 1803 states and 2391 transitions. [2022-07-12 17:12:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:22,290 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-12 17:12:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:22,301 INFO L225 Difference]: With dead ends: 1803 [2022-07-12 17:12:22,301 INFO L226 Difference]: Without dead ends: 1801 [2022-07-12 17:12:22,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:22,304 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 1807 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:22,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2561 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:12:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-07-12 17:12:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2022-07-12 17:12:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1212 states have (on average 1.2409240924092408) internal successors, (1504), 1264 states have internal predecessors, (1504), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2389 transitions. [2022-07-12 17:12:22,378 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2389 transitions. Word has length 82 [2022-07-12 17:12:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:22,379 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2389 transitions. [2022-07-12 17:12:22,380 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-12 17:12:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2389 transitions. [2022-07-12 17:12:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 17:12:22,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:22,381 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-12 17:12:22,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:12:22,382 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 26 more)] === [2022-07-12 17:12:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1830124668, now seen corresponding path program 1 times [2022-07-12 17:12:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:22,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725322098] [2022-07-12 17:12:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:22,620 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-12 17:12:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:22,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725322098] [2022-07-12 17:12:22,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725322098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:22,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802405902] [2022-07-12 17:12:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:22,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:22,622 INFO L87 Difference]: Start difference. First operand 1801 states and 2389 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-12 17:12:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:24,248 INFO L93 Difference]: Finished difference Result 1801 states and 2389 transitions. [2022-07-12 17:12:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:24,248 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-12 17:12:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:24,257 INFO L225 Difference]: With dead ends: 1801 [2022-07-12 17:12:24,257 INFO L226 Difference]: Without dead ends: 1799 [2022-07-12 17:12:24,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:24,259 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 1801 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:24,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 2559 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:12:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-07-12 17:12:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-07-12 17:12:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1211 states have (on average 1.240297274979356) internal successors, (1502), 1262 states have internal predecessors, (1502), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2387 transitions. [2022-07-12 17:12:24,331 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2387 transitions. Word has length 88 [2022-07-12 17:12:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:24,332 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2387 transitions. [2022-07-12 17:12:24,332 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-12 17:12:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2387 transitions. [2022-07-12 17:12:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 17:12:24,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:24,334 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:12:24,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:12:24,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -419326057, now seen corresponding path program 1 times [2022-07-12 17:12:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:24,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847857437] [2022-07-12 17:12:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:12:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:12:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:12:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:12:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:12:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:12:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 17:12:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847857437] [2022-07-12 17:12:24,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847857437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:24,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:24,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:12:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754795045] [2022-07-12 17:12:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:24,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:12:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:12:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:12:24,652 INFO L87 Difference]: Start difference. First operand 1799 states and 2387 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:12:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:27,283 INFO L93 Difference]: Finished difference Result 3691 states and 4926 transitions. [2022-07-12 17:12:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:12:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2022-07-12 17:12:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:27,293 INFO L225 Difference]: With dead ends: 3691 [2022-07-12 17:12:27,294 INFO L226 Difference]: Without dead ends: 1913 [2022-07-12 17:12:27,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:12:27,301 INFO L413 NwaCegarLoop]: 1211 mSDtfsCounter, 2093 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 4581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:27,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 4047 Invalid, 4581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:12:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-07-12 17:12:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1817. [2022-07-12 17:12:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1223 states have (on average 1.2363041700735895) internal successors, (1512), 1274 states have internal predecessors, (1512), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2397 transitions. [2022-07-12 17:12:27,382 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2397 transitions. Word has length 116 [2022-07-12 17:12:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:27,383 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2397 transitions. [2022-07-12 17:12:27,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:12:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2397 transitions. [2022-07-12 17:12:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 17:12:27,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:27,385 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:12:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:12:27,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash -419266475, now seen corresponding path program 1 times [2022-07-12 17:12:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:27,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600229033] [2022-07-12 17:12:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:12:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:12:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:12:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:12:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:12:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:12:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 17:12:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600229033] [2022-07-12 17:12:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600229033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:27,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:12:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498309791] [2022-07-12 17:12:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:27,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:12:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:12:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:12:27,622 INFO L87 Difference]: Start difference. First operand 1817 states and 2397 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 17:12:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:29,707 INFO L93 Difference]: Finished difference Result 1913 states and 2550 transitions. [2022-07-12 17:12:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:12:29,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2022-07-12 17:12:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:29,721 INFO L225 Difference]: With dead ends: 1913 [2022-07-12 17:12:29,722 INFO L226 Difference]: Without dead ends: 1911 [2022-07-12 17:12:29,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:12:29,724 INFO L413 NwaCegarLoop]: 1208 mSDtfsCounter, 1262 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:29,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 3486 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:12:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-07-12 17:12:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1815. [2022-07-12 17:12:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1222 states have (on average 1.234860883797054) internal successors, (1509), 1272 states have internal predecessors, (1509), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2394 transitions. [2022-07-12 17:12:29,805 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2394 transitions. Word has length 116 [2022-07-12 17:12:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:29,805 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2394 transitions. [2022-07-12 17:12:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 17:12:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2394 transitions. [2022-07-12 17:12:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:12:29,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:29,807 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-12 17:12:29,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:12:29,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 26 more)] === [2022-07-12 17:12:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1080066150, now seen corresponding path program 1 times [2022-07-12 17:12:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:29,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41087386] [2022-07-12 17:12:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:30,016 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-12 17:12:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41087386] [2022-07-12 17:12:30,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41087386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:30,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:30,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513860775] [2022-07-12 17:12:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:30,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:30,019 INFO L87 Difference]: Start difference. First operand 1815 states and 2394 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-12 17:12:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:31,434 INFO L93 Difference]: Finished difference Result 1815 states and 2394 transitions. [2022-07-12 17:12:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:31,434 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-12 17:12:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:31,441 INFO L225 Difference]: With dead ends: 1815 [2022-07-12 17:12:31,442 INFO L226 Difference]: Without dead ends: 1813 [2022-07-12 17:12:31,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:31,443 INFO L413 NwaCegarLoop]: 1212 mSDtfsCounter, 1786 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:31,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 2554 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-07-12 17:12:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-07-12 17:12:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1221 states have (on average 1.2342342342342343) internal successors, (1507), 1270 states have internal predecessors, (1507), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2392 transitions. [2022-07-12 17:12:31,522 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2392 transitions. Word has length 94 [2022-07-12 17:12:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:31,523 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2392 transitions. [2022-07-12 17:12:31,523 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-12 17:12:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2392 transitions. [2022-07-12 17:12:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:12:31,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:31,524 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:12:31,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:12:31,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1369630181, now seen corresponding path program 1 times [2022-07-12 17:12:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:31,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001016149] [2022-07-12 17:12:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:12:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:12:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:12:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:12:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:12:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:12:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 17:12:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:31,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001016149] [2022-07-12 17:12:31,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001016149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:31,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:31,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542041677] [2022-07-12 17:12:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:31,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:31,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:31,801 INFO L87 Difference]: Start difference. First operand 1813 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:12:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:33,351 INFO L93 Difference]: Finished difference Result 3695 states and 4917 transitions. [2022-07-12 17:12:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-07-12 17:12:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:33,360 INFO L225 Difference]: With dead ends: 3695 [2022-07-12 17:12:33,360 INFO L226 Difference]: Without dead ends: 1903 [2022-07-12 17:12:33,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:33,365 INFO L413 NwaCegarLoop]: 1202 mSDtfsCounter, 2184 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1321 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:33,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 2380 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1321 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:12:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-07-12 17:12:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1807. [2022-07-12 17:12:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1216 states have (on average 1.231907894736842) internal successors, (1498), 1264 states have internal predecessors, (1498), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2383 transitions. [2022-07-12 17:12:33,454 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2383 transitions. Word has length 120 [2022-07-12 17:12:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:33,454 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 2383 transitions. [2022-07-12 17:12:33,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:12:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2383 transitions. [2022-07-12 17:12:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:12:33,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:33,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:33,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:12:33,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 26 more)] === [2022-07-12 17:12:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1666453260, now seen corresponding path program 1 times [2022-07-12 17:12:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:33,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60261789] [2022-07-12 17:12:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:33,633 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-12 17:12:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:33,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60261789] [2022-07-12 17:12:33,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60261789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:33,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:33,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344703467] [2022-07-12 17:12:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:33,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:33,636 INFO L87 Difference]: Start difference. First operand 1807 states and 2383 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-12 17:12:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:35,117 INFO L93 Difference]: Finished difference Result 1807 states and 2383 transitions. [2022-07-12 17:12:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:35,118 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-12 17:12:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:35,125 INFO L225 Difference]: With dead ends: 1807 [2022-07-12 17:12:35,125 INFO L226 Difference]: Without dead ends: 1805 [2022-07-12 17:12:35,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:35,127 INFO L413 NwaCegarLoop]: 1205 mSDtfsCounter, 1765 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:35,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 2547 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-12 17:12:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2022-07-12 17:12:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1215 states have (on average 1.231275720164609) internal successors, (1496), 1262 states have internal predecessors, (1496), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2381 transitions. [2022-07-12 17:12:35,213 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2381 transitions. Word has length 100 [2022-07-12 17:12:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:35,213 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 2381 transitions. [2022-07-12 17:12:35,214 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-12 17:12:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2381 transitions. [2022-07-12 17:12:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:12:35,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:35,215 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-12 17:12:35,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:12:35,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 26 more)] === [2022-07-12 17:12:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1294274607, now seen corresponding path program 1 times [2022-07-12 17:12:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505788225] [2022-07-12 17:12:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:35,474 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-12 17:12:35,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505788225] [2022-07-12 17:12:35,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505788225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:35,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:35,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506199320] [2022-07-12 17:12:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:35,477 INFO L87 Difference]: Start difference. First operand 1805 states and 2381 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-12 17:12:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:36,927 INFO L93 Difference]: Finished difference Result 1805 states and 2381 transitions. [2022-07-12 17:12:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:36,928 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-12 17:12:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:36,935 INFO L225 Difference]: With dead ends: 1805 [2022-07-12 17:12:36,935 INFO L226 Difference]: Without dead ends: 1803 [2022-07-12 17:12:36,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:36,939 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1763 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:36,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2545 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-12 17:12:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2022-07-12 17:12:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1214 states have (on average 1.2306425041186162) internal successors, (1494), 1260 states have internal predecessors, (1494), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2379 transitions. [2022-07-12 17:12:37,026 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2379 transitions. Word has length 106 [2022-07-12 17:12:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:37,026 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2379 transitions. [2022-07-12 17:12:37,027 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-12 17:12:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2379 transitions. [2022-07-12 17:12:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 17:12:37,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:37,028 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-12 17:12:37,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:12:37,029 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 26 more)] === [2022-07-12 17:12:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1742479118, now seen corresponding path program 1 times [2022-07-12 17:12:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:37,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094557154] [2022-07-12 17:12:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,222 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-12 17:12:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:37,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094557154] [2022-07-12 17:12:37,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094557154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:37,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:37,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076850492] [2022-07-12 17:12:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:37,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:37,225 INFO L87 Difference]: Start difference. First operand 1803 states and 2379 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-12 17:12:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:38,741 INFO L93 Difference]: Finished difference Result 1803 states and 2379 transitions. [2022-07-12 17:12:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:38,742 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-12 17:12:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:38,750 INFO L225 Difference]: With dead ends: 1803 [2022-07-12 17:12:38,750 INFO L226 Difference]: Without dead ends: 1801 [2022-07-12 17:12:38,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:38,753 INFO L413 NwaCegarLoop]: 1201 mSDtfsCounter, 1751 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 2543 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:12:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-07-12 17:12:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2022-07-12 17:12:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1213 states have (on average 1.2300082440230833) internal successors, (1492), 1258 states have internal predecessors, (1492), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2377 transitions. [2022-07-12 17:12:38,842 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2377 transitions. Word has length 108 [2022-07-12 17:12:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:38,842 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2377 transitions. [2022-07-12 17:12:38,843 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-12 17:12:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2377 transitions. [2022-07-12 17:12:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 17:12:38,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:38,844 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-12 17:12:38,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:12:38,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 26 more)] === [2022-07-12 17:12:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1663050078, now seen corresponding path program 1 times [2022-07-12 17:12:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894402258] [2022-07-12 17:12:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:39,044 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-12 17:12:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894402258] [2022-07-12 17:12:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894402258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:39,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:39,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275191403] [2022-07-12 17:12:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:39,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:39,047 INFO L87 Difference]: Start difference. First operand 1801 states and 2377 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-12 17:12:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:40,623 INFO L93 Difference]: Finished difference Result 1801 states and 2377 transitions. [2022-07-12 17:12:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:40,624 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-12 17:12:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:40,629 INFO L225 Difference]: With dead ends: 1801 [2022-07-12 17:12:40,630 INFO L226 Difference]: Without dead ends: 1799 [2022-07-12 17:12:40,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:40,631 INFO L413 NwaCegarLoop]: 1199 mSDtfsCounter, 1747 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:40,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 2541 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:12:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-07-12 17:12:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-07-12 17:12:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1212 states have (on average 1.2293729372937294) internal successors, (1490), 1256 states have internal predecessors, (1490), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2375 transitions. [2022-07-12 17:12:40,722 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2375 transitions. Word has length 114 [2022-07-12 17:12:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:40,722 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2375 transitions. [2022-07-12 17:12:40,723 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-12 17:12:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2375 transitions. [2022-07-12 17:12:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:12:40,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:40,724 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-12 17:12:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:12:40,725 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 26 more)] === [2022-07-12 17:12:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1402453942, now seen corresponding path program 1 times [2022-07-12 17:12:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829647248] [2022-07-12 17:12:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:40,936 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-12 17:12:40,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829647248] [2022-07-12 17:12:40,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829647248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:40,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:40,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329679872] [2022-07-12 17:12:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:40,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:40,940 INFO L87 Difference]: Start difference. First operand 1799 states and 2375 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-12 17:12:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:42,295 INFO L93 Difference]: Finished difference Result 1799 states and 2375 transitions. [2022-07-12 17:12:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:42,295 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-12 17:12:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:42,301 INFO L225 Difference]: With dead ends: 1799 [2022-07-12 17:12:42,301 INFO L226 Difference]: Without dead ends: 1797 [2022-07-12 17:12:42,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:42,302 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1741 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:42,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 2539 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 17:12:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2022-07-12 17:12:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1797. [2022-07-12 17:12:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1211 states have (on average 1.2287365813377373) internal successors, (1488), 1254 states have internal predecessors, (1488), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2373 transitions. [2022-07-12 17:12:42,400 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2373 transitions. Word has length 120 [2022-07-12 17:12:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:42,401 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2373 transitions. [2022-07-12 17:12:42,401 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-12 17:12:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2373 transitions. [2022-07-12 17:12:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 17:12:42,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:42,402 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-12 17:12:42,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:12:42,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 26 more)] === [2022-07-12 17:12:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1949626691, now seen corresponding path program 1 times [2022-07-12 17:12:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723556303] [2022-07-12 17:12:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:42,611 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-12 17:12:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:42,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723556303] [2022-07-12 17:12:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723556303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:42,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:42,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652694872] [2022-07-12 17:12:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:42,613 INFO L87 Difference]: Start difference. First operand 1797 states and 2373 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-12 17:12:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:44,052 INFO L93 Difference]: Finished difference Result 1797 states and 2373 transitions. [2022-07-12 17:12:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:44,053 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-12 17:12:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:44,066 INFO L225 Difference]: With dead ends: 1797 [2022-07-12 17:12:44,066 INFO L226 Difference]: Without dead ends: 1795 [2022-07-12 17:12:44,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:44,068 INFO L413 NwaCegarLoop]: 1195 mSDtfsCounter, 1735 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:44,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 2537 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-07-12 17:12:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-07-12 17:12:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1210 states have (on average 1.228099173553719) internal successors, (1486), 1252 states have internal predecessors, (1486), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2371 transitions. [2022-07-12 17:12:44,183 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2371 transitions. Word has length 126 [2022-07-12 17:12:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:44,183 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2371 transitions. [2022-07-12 17:12:44,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:12:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2371 transitions. [2022-07-12 17:12:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 17:12:44,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:44,185 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:44,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:12:44,185 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1159748716, now seen corresponding path program 1 times [2022-07-12 17:12:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:44,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961339725] [2022-07-12 17:12:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:12:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:12:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:12:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:12:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:12:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:12:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:12:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-12 17:12:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:44,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961339725] [2022-07-12 17:12:44,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961339725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:44,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:12:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814797974] [2022-07-12 17:12:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:44,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:12:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:12:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:12:44,461 INFO L87 Difference]: Start difference. First operand 1795 states and 2371 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:12:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:46,117 INFO L93 Difference]: Finished difference Result 3665 states and 4865 transitions. [2022-07-12 17:12:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2022-07-12 17:12:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:46,126 INFO L225 Difference]: With dead ends: 3665 [2022-07-12 17:12:46,126 INFO L226 Difference]: Without dead ends: 1891 [2022-07-12 17:12:46,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:12:46,132 INFO L413 NwaCegarLoop]: 1031 mSDtfsCounter, 2468 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:46,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 2193 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:12:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-07-12 17:12:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1789. [2022-07-12 17:12:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1205 states have (on average 1.2257261410788383) internal successors, (1477), 1246 states have internal predecessors, (1477), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2362 transitions. [2022-07-12 17:12:46,266 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2362 transitions. Word has length 149 [2022-07-12 17:12:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:46,268 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2362 transitions. [2022-07-12 17:12:46,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:12:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2362 transitions. [2022-07-12 17:12:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 17:12:46,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:46,270 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-12 17:12:46,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:12:46,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 26 more)] === [2022-07-12 17:12:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1652311080, now seen corresponding path program 1 times [2022-07-12 17:12:46,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:46,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226623245] [2022-07-12 17:12:46,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:46,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:46,471 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-12 17:12:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:46,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226623245] [2022-07-12 17:12:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226623245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:46,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:46,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477224175] [2022-07-12 17:12:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:46,474 INFO L87 Difference]: Start difference. First operand 1789 states and 2362 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-12 17:12:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:47,930 INFO L93 Difference]: Finished difference Result 1789 states and 2362 transitions. [2022-07-12 17:12:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:47,931 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-12 17:12:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:47,937 INFO L225 Difference]: With dead ends: 1789 [2022-07-12 17:12:47,938 INFO L226 Difference]: Without dead ends: 1787 [2022-07-12 17:12:47,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:47,939 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 1724 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:47,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 2516 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2022-07-12 17:12:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1787. [2022-07-12 17:12:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1204 states have (on average 1.2250830564784052) internal successors, (1475), 1244 states have internal predecessors, (1475), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2360 transitions. [2022-07-12 17:12:48,058 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2360 transitions. Word has length 132 [2022-07-12 17:12:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:48,058 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2360 transitions. [2022-07-12 17:12:48,059 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-12 17:12:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2360 transitions. [2022-07-12 17:12:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 17:12:48,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:48,060 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:12:48,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:12:48,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2146398211, now seen corresponding path program 1 times [2022-07-12 17:12:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:48,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998649391] [2022-07-12 17:12:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:48,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:12:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:12:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:12:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:12:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:12:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:12:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:12:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:12:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-12 17:12:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:48,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998649391] [2022-07-12 17:12:48,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998649391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:12:48,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262569456] [2022-07-12 17:12:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:48,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:12:48,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:12:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:12:48,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 17:12:48,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:48,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262569456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:48,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:12:48,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 17:12:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050915937] [2022-07-12 17:12:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:12:48,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:48,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:12:48,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:12:48,969 INFO L87 Difference]: Start difference. First operand 1787 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:12:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:49,103 INFO L93 Difference]: Finished difference Result 3547 states and 4682 transitions. [2022-07-12 17:12:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:12:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-12 17:12:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:49,110 INFO L225 Difference]: With dead ends: 3547 [2022-07-12 17:12:49,111 INFO L226 Difference]: Without dead ends: 1781 [2022-07-12 17:12:49,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:12:49,117 INFO L413 NwaCegarLoop]: 1280 mSDtfsCounter, 1225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:49,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1280 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:12:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-07-12 17:12:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2022-07-12 17:12:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1199 states have (on average 1.2226855713094245) internal successors, (1466), 1238 states have internal predecessors, (1466), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2351 transitions. [2022-07-12 17:12:49,220 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2351 transitions. Word has length 155 [2022-07-12 17:12:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:49,220 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2351 transitions. [2022-07-12 17:12:49,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:12:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2351 transitions. [2022-07-12 17:12:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 17:12:49,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:49,222 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-12 17:12:49,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 17:12:49,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 26 more)] === [2022-07-12 17:12:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -158589524, now seen corresponding path program 1 times [2022-07-12 17:12:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266919647] [2022-07-12 17:12:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:49,680 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-12 17:12:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266919647] [2022-07-12 17:12:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266919647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412621597] [2022-07-12 17:12:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:49,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:49,684 INFO L87 Difference]: Start difference. First operand 1781 states and 2351 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:12:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:51,434 INFO L93 Difference]: Finished difference Result 1781 states and 2351 transitions. [2022-07-12 17:12:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:51,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-12 17:12:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:51,440 INFO L225 Difference]: With dead ends: 1781 [2022-07-12 17:12:51,441 INFO L226 Difference]: Without dead ends: 1779 [2022-07-12 17:12:51,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:51,442 INFO L413 NwaCegarLoop]: 1181 mSDtfsCounter, 1713 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:51,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 2495 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 17:12:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-07-12 17:12:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-07-12 17:12:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1198 states have (on average 1.2220367278797997) internal successors, (1464), 1236 states have internal predecessors, (1464), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2349 transitions. [2022-07-12 17:12:51,554 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2349 transitions. Word has length 138 [2022-07-12 17:12:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:51,555 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2349 transitions. [2022-07-12 17:12:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:12:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2349 transitions. [2022-07-12 17:12:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:12:51,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:51,557 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:51,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:12:51,557 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash -362451879, now seen corresponding path program 1 times [2022-07-12 17:12:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:51,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206390796] [2022-07-12 17:12:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:12:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:51,757 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-12 17:12:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206390796] [2022-07-12 17:12:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206390796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:51,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162339584] [2022-07-12 17:12:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:51,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:51,760 INFO L87 Difference]: Start difference. First operand 1779 states and 2349 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:12:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:53,348 INFO L93 Difference]: Finished difference Result 1779 states and 2349 transitions. [2022-07-12 17:12:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:53,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-12 17:12:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:53,355 INFO L225 Difference]: With dead ends: 1779 [2022-07-12 17:12:53,355 INFO L226 Difference]: Without dead ends: 1777 [2022-07-12 17:12:53,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:53,357 INFO L413 NwaCegarLoop]: 1179 mSDtfsCounter, 1707 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:53,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 2493 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:12:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-07-12 17:12:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2022-07-12 17:12:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1197 states have (on average 1.2213868003341688) internal successors, (1462), 1234 states have internal predecessors, (1462), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2347 transitions. [2022-07-12 17:12:53,457 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2347 transitions. Word has length 144 [2022-07-12 17:12:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:53,458 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 2347 transitions. [2022-07-12 17:12:53,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:12:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2347 transitions. [2022-07-12 17:12:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 17:12:53,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:53,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:53,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:12:53,460 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1691986718, now seen corresponding path program 1 times [2022-07-12 17:12:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:53,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184837433] [2022-07-12 17:12:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:12:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:53,650 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-12 17:12:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184837433] [2022-07-12 17:12:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184837433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000523424] [2022-07-12 17:12:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:53,653 INFO L87 Difference]: Start difference. First operand 1777 states and 2347 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:12:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:55,176 INFO L93 Difference]: Finished difference Result 1777 states and 2347 transitions. [2022-07-12 17:12:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-12 17:12:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:55,181 INFO L225 Difference]: With dead ends: 1777 [2022-07-12 17:12:55,181 INFO L226 Difference]: Without dead ends: 1775 [2022-07-12 17:12:55,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:55,183 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1701 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:55,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 2491 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-12 17:12:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2022-07-12 17:12:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1196 states have (on average 1.2207357859531773) internal successors, (1460), 1232 states have internal predecessors, (1460), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2345 transitions. [2022-07-12 17:12:55,288 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2345 transitions. Word has length 150 [2022-07-12 17:12:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:55,289 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2345 transitions. [2022-07-12 17:12:55,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:12:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2345 transitions. [2022-07-12 17:12:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 17:12:55,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:55,291 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:55,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:12:55,291 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash 735405847, now seen corresponding path program 1 times [2022-07-12 17:12:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:55,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778709421] [2022-07-12 17:12:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:12:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:12:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:55,504 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-12 17:12:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778709421] [2022-07-12 17:12:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778709421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:55,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:55,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137406998] [2022-07-12 17:12:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:55,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:55,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:55,508 INFO L87 Difference]: Start difference. First operand 1775 states and 2345 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:12:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:56,920 INFO L93 Difference]: Finished difference Result 1775 states and 2345 transitions. [2022-07-12 17:12:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-12 17:12:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:56,925 INFO L225 Difference]: With dead ends: 1775 [2022-07-12 17:12:56,925 INFO L226 Difference]: Without dead ends: 1773 [2022-07-12 17:12:56,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:56,927 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 1695 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:56,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 2489 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-07-12 17:12:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2022-07-12 17:12:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1195 states have (on average 1.2200836820083683) internal successors, (1458), 1230 states have internal predecessors, (1458), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2343 transitions. [2022-07-12 17:12:57,039 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2343 transitions. Word has length 156 [2022-07-12 17:12:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:57,040 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2343 transitions. [2022-07-12 17:12:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:12:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2343 transitions. [2022-07-12 17:12:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 17:12:57,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:57,043 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:57,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:12:57,043 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash -602093927, now seen corresponding path program 1 times [2022-07-12 17:12:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:57,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193064480] [2022-07-12 17:12:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:12:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:12:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:12:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:57,249 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-12 17:12:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193064480] [2022-07-12 17:12:57,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193064480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:57,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:57,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211943603] [2022-07-12 17:12:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:57,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:57,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:57,252 INFO L87 Difference]: Start difference. First operand 1773 states and 2343 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:12:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:58,740 INFO L93 Difference]: Finished difference Result 1773 states and 2343 transitions. [2022-07-12 17:12:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-12 17:12:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:58,745 INFO L225 Difference]: With dead ends: 1773 [2022-07-12 17:12:58,745 INFO L226 Difference]: Without dead ends: 1771 [2022-07-12 17:12:58,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:12:58,746 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1689 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:58,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 2487 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:12:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-12 17:12:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2022-07-12 17:12:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1194 states have (on average 1.219430485762144) internal successors, (1456), 1228 states have internal predecessors, (1456), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:12:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2341 transitions. [2022-07-12 17:12:58,860 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2341 transitions. Word has length 162 [2022-07-12 17:12:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:58,861 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2341 transitions. [2022-07-12 17:12:58,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:12:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2341 transitions. [2022-07-12 17:12:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 17:12:58,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:58,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:58,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:12:58,864 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:12:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1976939342, now seen corresponding path program 1 times [2022-07-12 17:12:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:58,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493826450] [2022-07-12 17:12:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:12:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:12:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:12:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:12:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:12:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:12:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:58,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:12:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:12:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:12:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:12:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:12:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:12:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:12:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:12:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:12:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:12:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:12:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:12:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,058 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-12 17:12:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:59,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493826450] [2022-07-12 17:12:59,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493826450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:59,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:59,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767549562] [2022-07-12 17:12:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:59,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:59,061 INFO L87 Difference]: Start difference. First operand 1771 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:13:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:00,542 INFO L93 Difference]: Finished difference Result 1771 states and 2341 transitions. [2022-07-12 17:13:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-12 17:13:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:00,548 INFO L225 Difference]: With dead ends: 1771 [2022-07-12 17:13:00,548 INFO L226 Difference]: Without dead ends: 1769 [2022-07-12 17:13:00,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:00,549 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1683 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:00,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2485 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:13:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-07-12 17:13:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-07-12 17:13:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1193 states have (on average 1.2187761944677284) internal successors, (1454), 1226 states have internal predecessors, (1454), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-12 17:13:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2339 transitions. [2022-07-12 17:13:00,710 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2339 transitions. Word has length 168 [2022-07-12 17:13:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:00,710 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2339 transitions. [2022-07-12 17:13:00,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:13:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2339 transitions. [2022-07-12 17:13:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-12 17:13:00,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:00,714 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:00,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:13:00,714 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 206781077, now seen corresponding path program 1 times [2022-07-12 17:13:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:00,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595970912] [2022-07-12 17:13:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:13:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:13:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:13:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:13:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:13:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:13:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:00,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 17:13:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:13:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 17:13:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-12 17:13:01,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:01,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595970912] [2022-07-12 17:13:01,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595970912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:01,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:01,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 17:13:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301235650] [2022-07-12 17:13:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:01,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:13:01,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:13:01,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:13:01,087 INFO L87 Difference]: Start difference. First operand 1769 states and 2339 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 17:13:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:10,215 INFO L93 Difference]: Finished difference Result 3023 states and 3986 transitions. [2022-07-12 17:13:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 17:13:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 218 [2022-07-12 17:13:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:10,225 INFO L225 Difference]: With dead ends: 3023 [2022-07-12 17:13:10,225 INFO L226 Difference]: Without dead ends: 3021 [2022-07-12 17:13:10,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 17:13:10,227 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 6488 mSDsluCounter, 6268 mSDsCounter, 0 mSdLazyCounter, 10636 mSolverCounterSat, 5243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6776 SdHoareTripleChecker+Valid, 8509 SdHoareTripleChecker+Invalid, 15879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5243 IncrementalHoareTripleChecker+Valid, 10636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:10,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6776 Valid, 8509 Invalid, 15879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5243 Valid, 10636 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-07-12 17:13:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-07-12 17:13:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2554. [2022-07-12 17:13:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1729 states have (on average 1.2249855407750145) internal successors, (2118), 1777 states have internal predecessors, (2118), 639 states have call successors, (639), 185 states have call predecessors, (639), 180 states have return successors, (639), 623 states have call predecessors, (639), 637 states have call successors, (639) [2022-07-12 17:13:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3396 transitions. [2022-07-12 17:13:10,417 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3396 transitions. Word has length 218 [2022-07-12 17:13:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:10,417 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3396 transitions. [2022-07-12 17:13:10,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 17:13:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3396 transitions. [2022-07-12 17:13:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-12 17:13:10,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:10,420 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:10,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:13:10,420 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -790291276, now seen corresponding path program 1 times [2022-07-12 17:13:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344977435] [2022-07-12 17:13:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:13:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:13:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:13:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:13:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:13:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:13:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 17:13:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:13:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 17:13:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-12 17:13:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344977435] [2022-07-12 17:13:10,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344977435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:13:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168981925] [2022-07-12 17:13:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:10,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:10,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:10,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:10,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 17:13:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:11,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 17:13:11,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-12 17:13:11,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:11,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168981925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:11,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:13:11,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 15 [2022-07-12 17:13:11,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325922687] [2022-07-12 17:13:11,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:11,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:13:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:11,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:13:11,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:13:11,669 INFO L87 Difference]: Start difference. First operand 2554 states and 3396 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-12 17:13:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:12,705 INFO L93 Difference]: Finished difference Result 5417 states and 7251 transitions. [2022-07-12 17:13:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:13:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 218 [2022-07-12 17:13:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:12,718 INFO L225 Difference]: With dead ends: 5417 [2022-07-12 17:13:12,718 INFO L226 Difference]: Without dead ends: 2884 [2022-07-12 17:13:12,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:13:12,727 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 80 mSDsluCounter, 11115 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 12523 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:12,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 12523 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:13:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2022-07-12 17:13:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2587. [2022-07-12 17:13:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 1753 states have (on average 1.221905305191101) internal successors, (2142), 1801 states have internal predecessors, (2142), 642 states have call successors, (642), 185 states have call predecessors, (642), 186 states have return successors, (654), 632 states have call predecessors, (654), 640 states have call successors, (654) [2022-07-12 17:13:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3438 transitions. [2022-07-12 17:13:12,946 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3438 transitions. Word has length 218 [2022-07-12 17:13:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:12,947 INFO L495 AbstractCegarLoop]: Abstraction has 2587 states and 3438 transitions. [2022-07-12 17:13:12,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-12 17:13:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3438 transitions. [2022-07-12 17:13:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 17:13:12,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:12,949 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:12,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:13,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 17:13:13,176 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -236273954, now seen corresponding path program 1 times [2022-07-12 17:13:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:13,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452591037] [2022-07-12 17:13:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:13:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:13:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:13:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:13:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:13:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:13:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:13:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:13:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:13:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:13:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:13:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:13:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:13:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:13:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:13:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:13:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:13:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:13:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:13:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:13:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:13:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:13:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:13:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452591037] [2022-07-12 17:13:13,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452591037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:13,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:13,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927931927] [2022-07-12 17:13:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:13,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:13,433 INFO L87 Difference]: Start difference. First operand 2587 states and 3438 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:13:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:14,910 INFO L93 Difference]: Finished difference Result 2587 states and 3438 transitions. [2022-07-12 17:13:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:14,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-12 17:13:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:14,918 INFO L225 Difference]: With dead ends: 2587 [2022-07-12 17:13:14,918 INFO L226 Difference]: Without dead ends: 2585 [2022-07-12 17:13:14,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:14,920 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1677 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:14,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2483 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:13:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2022-07-12 17:13:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2022-07-12 17:13:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 1752 states have (on average 1.221461187214612) internal successors, (2140), 1799 states have internal predecessors, (2140), 642 states have call successors, (642), 185 states have call predecessors, (642), 186 states have return successors, (654), 632 states have call predecessors, (654), 640 states have call successors, (654) [2022-07-12 17:13:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3436 transitions. [2022-07-12 17:13:15,124 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3436 transitions. Word has length 174 [2022-07-12 17:13:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:15,125 INFO L495 AbstractCegarLoop]: Abstraction has 2585 states and 3436 transitions. [2022-07-12 17:13:15,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:13:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3436 transitions. [2022-07-12 17:13:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 17:13:15,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:15,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:15,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:13:15,127 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1377744045, now seen corresponding path program 1 times [2022-07-12 17:13:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:15,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842767681] [2022-07-12 17:13:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:13:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:13:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:13:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:13:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:13:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:13:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:13:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:13:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:13:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:13:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:13:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:13:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:13:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:13:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:13:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:13:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:13:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:13:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:13:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:13:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:13:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:13:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:13:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:15,352 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-12 17:13:15,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:15,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842767681] [2022-07-12 17:13:15,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842767681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:15,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:15,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411916188] [2022-07-12 17:13:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:15,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:15,355 INFO L87 Difference]: Start difference. First operand 2585 states and 3436 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:13:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:16,810 INFO L93 Difference]: Finished difference Result 2585 states and 3436 transitions. [2022-07-12 17:13:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-12 17:13:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:16,820 INFO L225 Difference]: With dead ends: 2585 [2022-07-12 17:13:16,820 INFO L226 Difference]: Without dead ends: 2410 [2022-07-12 17:13:16,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:16,825 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 1668 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:16,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 2482 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 17:13:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-07-12 17:13:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2022-07-12 17:13:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1647 states have (on average 1.2331511839708562) internal successors, (2031), 1691 states have internal predecessors, (2031), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 585 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-12 17:13:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3229 transitions. [2022-07-12 17:13:17,022 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3229 transitions. Word has length 180 [2022-07-12 17:13:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:17,022 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 3229 transitions. [2022-07-12 17:13:17,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:13:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3229 transitions. [2022-07-12 17:13:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-12 17:13:17,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:17,024 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:17,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 17:13:17,025 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1889934448, now seen corresponding path program 1 times [2022-07-12 17:13:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:17,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671337009] [2022-07-12 17:13:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:17,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131811488] [2022-07-12 17:13:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:17,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:17,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 17:13:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:18,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 2242 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 17:13:18,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 174 proven. 3 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-12 17:13:18,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:13:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-12 17:13:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671337009] [2022-07-12 17:13:18,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131811488] [2022-07-12 17:13:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131811488] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:13:18,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:13:18,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:13:18,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548737655] [2022-07-12 17:13:18,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:13:18,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:13:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:18,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:13:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:13:18,662 INFO L87 Difference]: Start difference. First operand 2410 states and 3229 transitions. Second operand has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) [2022-07-12 17:13:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:19,294 INFO L93 Difference]: Finished difference Result 4805 states and 6437 transitions. [2022-07-12 17:13:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:13:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) Word has length 260 [2022-07-12 17:13:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:19,304 INFO L225 Difference]: With dead ends: 4805 [2022-07-12 17:13:19,304 INFO L226 Difference]: Without dead ends: 2410 [2022-07-12 17:13:19,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 505 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:13:19,313 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 761 mSDsluCounter, 8143 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 9228 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:19,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 9228 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 17:13:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-07-12 17:13:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2022-07-12 17:13:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1647 states have (on average 1.2325440194292654) internal successors, (2030), 1690 states have internal predecessors, (2030), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 585 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-12 17:13:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3228 transitions. [2022-07-12 17:13:19,518 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3228 transitions. Word has length 260 [2022-07-12 17:13:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:19,518 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 3228 transitions. [2022-07-12 17:13:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) [2022-07-12 17:13:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3228 transitions. [2022-07-12 17:13:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-12 17:13:19,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:19,521 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:19,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:19,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 17:13:19,748 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash -686638520, now seen corresponding path program 1 times [2022-07-12 17:13:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:19,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941524214] [2022-07-12 17:13:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:19,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805058760] [2022-07-12 17:13:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:19,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:19,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:19,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 17:13:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:20,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 2188 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 17:13:20,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-12 17:13:20,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:20,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:20,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941524214] [2022-07-12 17:13:20,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:20,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805058760] [2022-07-12 17:13:20,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805058760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:20,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:20,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:13:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834765841] [2022-07-12 17:13:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:20,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:13:20,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:13:20,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:20,618 INFO L87 Difference]: Start difference. First operand 2410 states and 3228 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 17:13:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:21,677 INFO L93 Difference]: Finished difference Result 5038 states and 6771 transitions. [2022-07-12 17:13:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:13:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) Word has length 243 [2022-07-12 17:13:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:21,688 INFO L225 Difference]: With dead ends: 5038 [2022-07-12 17:13:21,688 INFO L226 Difference]: Without dead ends: 2647 [2022-07-12 17:13:21,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:13:21,696 INFO L413 NwaCegarLoop]: 1227 mSDtfsCounter, 80 mSDsluCounter, 9686 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 10913 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:21,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 10913 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:13:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2022-07-12 17:13:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2416. [2022-07-12 17:13:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1653 states have (on average 1.2316999395039323) internal successors, (2036), 1693 states have internal predecessors, (2036), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 588 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-12 17:13:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3234 transitions. [2022-07-12 17:13:21,906 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3234 transitions. Word has length 243 [2022-07-12 17:13:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:21,906 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 3234 transitions. [2022-07-12 17:13:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 17:13:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3234 transitions. [2022-07-12 17:13:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-12 17:13:21,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:21,909 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:21,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 17:13:22,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:22,136 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:22,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1119375373, now seen corresponding path program 1 times [2022-07-12 17:13:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:22,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117312391] [2022-07-12 17:13:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:22,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:22,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543565366] [2022-07-12 17:13:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:22,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:22,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 17:13:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:22,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 2260 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 17:13:22,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 17:13:22,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117312391] [2022-07-12 17:13:22,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543565366] [2022-07-12 17:13:22,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543565366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:22,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:22,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:13:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873077641] [2022-07-12 17:13:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:22,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:13:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:13:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:13:22,937 INFO L87 Difference]: Start difference. First operand 2416 states and 3234 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:13:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:23,237 INFO L93 Difference]: Finished difference Result 5122 states and 6897 transitions. [2022-07-12 17:13:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:13:23,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) Word has length 264 [2022-07-12 17:13:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:23,245 INFO L225 Difference]: With dead ends: 5122 [2022-07-12 17:13:23,246 INFO L226 Difference]: Without dead ends: 2725 [2022-07-12 17:13:23,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:13:23,251 INFO L413 NwaCegarLoop]: 1250 mSDtfsCounter, 87 mSDsluCounter, 8621 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 9871 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:23,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 9871 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:13:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2022-07-12 17:13:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2443. [2022-07-12 17:13:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1674 states have (on average 1.2287933094384706) internal successors, (2057), 1714 states have internal predecessors, (2057), 593 states have call successors, (593), 165 states have call predecessors, (593), 172 states have return successors, (614), 594 states have call predecessors, (614), 591 states have call successors, (614) [2022-07-12 17:13:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3264 transitions. [2022-07-12 17:13:23,455 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3264 transitions. Word has length 264 [2022-07-12 17:13:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:23,455 INFO L495 AbstractCegarLoop]: Abstraction has 2443 states and 3264 transitions. [2022-07-12 17:13:23,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:13:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3264 transitions. [2022-07-12 17:13:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-12 17:13:23,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:23,457 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:23,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:23,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:23,684 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1546746240, now seen corresponding path program 1 times [2022-07-12 17:13:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167356276] [2022-07-12 17:13:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:13:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:13:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:13:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:13:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:13:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:13:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:13:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:13:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 17:13:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:13:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:13:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:13:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 17:13:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:13:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:13:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-12 17:13:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167356276] [2022-07-12 17:13:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167356276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:24,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:24,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:13:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977142630] [2022-07-12 17:13:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:24,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:13:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:13:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:24,008 INFO L87 Difference]: Start difference. First operand 2443 states and 3264 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:13:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:26,111 INFO L93 Difference]: Finished difference Result 2568 states and 3454 transitions. [2022-07-12 17:13:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 17:13:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 239 [2022-07-12 17:13:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:26,119 INFO L225 Difference]: With dead ends: 2568 [2022-07-12 17:13:26,119 INFO L226 Difference]: Without dead ends: 2566 [2022-07-12 17:13:26,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:13:26,121 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 2113 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:26,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 3135 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 17:13:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-12 17:13:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2459. [2022-07-12 17:13:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1685 states have (on average 1.225519287833828) internal successors, (2065), 1724 states have internal predecessors, (2065), 593 states have call successors, (593), 171 states have call predecessors, (593), 178 states have return successors, (614), 594 states have call predecessors, (614), 591 states have call successors, (614) [2022-07-12 17:13:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3272 transitions. [2022-07-12 17:13:26,300 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3272 transitions. Word has length 239 [2022-07-12 17:13:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:26,301 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3272 transitions. [2022-07-12 17:13:26,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:13:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3272 transitions. [2022-07-12 17:13:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-07-12 17:13:26,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:26,303 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:26,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 17:13:26,304 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1468486265, now seen corresponding path program 1 times [2022-07-12 17:13:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875217482] [2022-07-12 17:13:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:26,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:26,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759260475] [2022-07-12 17:13:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:26,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:26,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 17:13:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:29,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 17:13:29,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-07-12 17:13:29,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:13:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-07-12 17:13:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:29,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875217482] [2022-07-12 17:13:29,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759260475] [2022-07-12 17:13:29,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759260475] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:13:29,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:13:29,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:13:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046801236] [2022-07-12 17:13:29,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:13:29,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:13:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:29,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:13:29,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:13:29,711 INFO L87 Difference]: Start difference. First operand 2459 states and 3272 transitions. Second operand has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-12 17:13:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:29,987 INFO L93 Difference]: Finished difference Result 4586 states and 6057 transitions. [2022-07-12 17:13:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:13:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) Word has length 280 [2022-07-12 17:13:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:29,995 INFO L225 Difference]: With dead ends: 4586 [2022-07-12 17:13:29,995 INFO L226 Difference]: Without dead ends: 2146 [2022-07-12 17:13:30,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:13:30,000 INFO L413 NwaCegarLoop]: 1089 mSDtfsCounter, 15 mSDsluCounter, 6484 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7573 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:30,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7573 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:13:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-07-12 17:13:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2144. [2022-07-12 17:13:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1455 states have (on average 1.2) internal successors, (1746), 1490 states have internal predecessors, (1746), 520 states have call successors, (520), 161 states have call predecessors, (520), 166 states have return successors, (537), 520 states have call predecessors, (537), 518 states have call successors, (537) [2022-07-12 17:13:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2803 transitions. [2022-07-12 17:13:30,177 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2803 transitions. Word has length 280 [2022-07-12 17:13:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:30,178 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 2803 transitions. [2022-07-12 17:13:30,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-12 17:13:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2803 transitions. [2022-07-12 17:13:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-12 17:13:30,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:30,181 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:30,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 17:13:30,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:30,400 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 122220891, now seen corresponding path program 1 times [2022-07-12 17:13:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:30,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410172976] [2022-07-12 17:13:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:13:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:13:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:13:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:13:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:13:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:13:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:13:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:13:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 17:13:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:13:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:13:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:13:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 17:13:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:13:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:13:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:13:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-12 17:13:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410172976] [2022-07-12 17:13:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410172976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 17:13:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430789154] [2022-07-12 17:13:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:30,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 17:13:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 17:13:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:13:30,787 INFO L87 Difference]: Start difference. First operand 2144 states and 2803 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-12 17:13:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:33,387 INFO L93 Difference]: Finished difference Result 2252 states and 2980 transitions. [2022-07-12 17:13:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:13:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) Word has length 252 [2022-07-12 17:13:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:33,395 INFO L225 Difference]: With dead ends: 2252 [2022-07-12 17:13:33,395 INFO L226 Difference]: Without dead ends: 2250 [2022-07-12 17:13:33,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:13:33,397 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1626 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 4015 SdHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1880 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 4015 Invalid, 4563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1880 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 17:13:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-07-12 17:13:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2142. [2022-07-12 17:13:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1454 states have (on average 1.1980742778541953) internal successors, (1742), 1488 states have internal predecessors, (1742), 520 states have call successors, (520), 161 states have call predecessors, (520), 166 states have return successors, (537), 520 states have call predecessors, (537), 518 states have call successors, (537) [2022-07-12 17:13:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2799 transitions. [2022-07-12 17:13:33,570 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2799 transitions. Word has length 252 [2022-07-12 17:13:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:33,571 INFO L495 AbstractCegarLoop]: Abstraction has 2142 states and 2799 transitions. [2022-07-12 17:13:33,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-12 17:13:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2799 transitions. [2022-07-12 17:13:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-07-12 17:13:33,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:33,577 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:33,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 17:13:33,577 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 26 more)] === [2022-07-12 17:13:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -578147250, now seen corresponding path program 1 times [2022-07-12 17:13:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:33,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439029976] [2022-07-12 17:13:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:33,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:33,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485243704] [2022-07-12 17:13:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:33,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:33,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 17:13:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:34,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 17:13:34,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2022-07-12 17:13:34,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:13:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2022-07-12 17:13:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439029976] [2022-07-12 17:13:35,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485243704] [2022-07-12 17:13:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485243704] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:13:35,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:13:35,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2022-07-12 17:13:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706263995] [2022-07-12 17:13:35,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:13:35,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 17:13:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 17:13:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:13:35,138 INFO L87 Difference]: Start difference. First operand 2142 states and 2799 transitions. Second operand has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-12 17:13:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:35,616 INFO L93 Difference]: Finished difference Result 2150 states and 2806 transitions. [2022-07-12 17:13:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 17:13:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) Word has length 382 [2022-07-12 17:13:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:35,622 INFO L225 Difference]: With dead ends: 2150 [2022-07-12 17:13:35,622 INFO L226 Difference]: Without dead ends: 2142 [2022-07-12 17:13:35,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-07-12 17:13:35,624 INFO L413 NwaCegarLoop]: 1069 mSDtfsCounter, 461 mSDsluCounter, 14302 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 15371 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:35,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 15371 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 17:13:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-07-12 17:13:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2138. [2022-07-12 17:13:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1453 states have (on average 1.1968341362697867) internal successors, (1739), 1485 states have internal predecessors, (1739), 517 states have call successors, (517), 161 states have call predecessors, (517), 166 states have return successors, (535), 519 states have call predecessors, (535), 516 states have call successors, (535) [2022-07-12 17:13:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2791 transitions. [2022-07-12 17:13:35,767 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2791 transitions. Word has length 382 [2022-07-12 17:13:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:35,767 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2791 transitions. [2022-07-12 17:13:35,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-12 17:13:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2791 transitions. [2022-07-12 17:13:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2022-07-12 17:13:35,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:35,774 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:35,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:35,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:35,988 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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 26 more)] === [2022-07-12 17:13:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1729621242, now seen corresponding path program 1 times [2022-07-12 17:13:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:35,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181502461] [2022-07-12 17:13:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:36,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:36,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185063829] [2022-07-12 17:13:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:36,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:36,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:36,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 17:13:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:41,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 17:13:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2022-07-12 17:13:41,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:41,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181502461] [2022-07-12 17:13:41,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:41,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185063829] [2022-07-12 17:13:41,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185063829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:41,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:41,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75184690] [2022-07-12 17:13:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:41,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:41,461 INFO L87 Difference]: Start difference. First operand 2138 states and 2791 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-12 17:13:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:41,706 INFO L93 Difference]: Finished difference Result 3987 states and 5268 transitions. [2022-07-12 17:13:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:13:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) Word has length 388 [2022-07-12 17:13:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:41,713 INFO L225 Difference]: With dead ends: 3987 [2022-07-12 17:13:41,714 INFO L226 Difference]: Without dead ends: 2339 [2022-07-12 17:13:41,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:13:41,720 INFO L413 NwaCegarLoop]: 1215 mSDtfsCounter, 368 mSDsluCounter, 4397 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 5612 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:41,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 5612 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:13:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2022-07-12 17:13:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2138. [2022-07-12 17:13:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1453 states have (on average 1.1954576737783895) internal successors, (1737), 1485 states have internal predecessors, (1737), 517 states have call successors, (517), 161 states have call predecessors, (517), 166 states have return successors, (535), 519 states have call predecessors, (535), 516 states have call successors, (535) [2022-07-12 17:13:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2789 transitions. [2022-07-12 17:13:41,877 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2789 transitions. Word has length 388 [2022-07-12 17:13:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:41,878 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2789 transitions. [2022-07-12 17:13:41,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-12 17:13:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2789 transitions. [2022-07-12 17:13:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-07-12 17:13:41,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:41,884 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:41,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:42,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 17:13:42,106 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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 26 more)] === [2022-07-12 17:13:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash -546554695, now seen corresponding path program 1 times [2022-07-12 17:13:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720387847] [2022-07-12 17:13:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:42,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:42,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923587776] [2022-07-12 17:13:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:42,180 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:42,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 17:13:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:42,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 2730 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 17:13:42,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 41 proven. 123 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-07-12 17:13:43,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:13:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2022-07-12 17:13:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720387847] [2022-07-12 17:13:43,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923587776] [2022-07-12 17:13:43,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923587776] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 17:13:43,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:13:43,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2022-07-12 17:13:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895529310] [2022-07-12 17:13:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:43,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:13:43,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:43,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:13:43,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:13:43,812 INFO L87 Difference]: Start difference. First operand 2138 states and 2789 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2022-07-12 17:13:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:47,862 INFO L93 Difference]: Finished difference Result 4306 states and 5605 transitions. [2022-07-12 17:13:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:13:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 403 [2022-07-12 17:13:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:47,876 INFO L225 Difference]: With dead ends: 4306 [2022-07-12 17:13:47,877 INFO L226 Difference]: Without dead ends: 4271 [2022-07-12 17:13:47,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 795 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:13:47,880 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 3609 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 4557 mSolverCounterSat, 2206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3717 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 6763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2206 IncrementalHoareTripleChecker+Valid, 4557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:47,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3717 Valid, 4553 Invalid, 6763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2206 Valid, 4557 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 17:13:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-07-12 17:13:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4255. [2022-07-12 17:13:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 2891 states have (on average 1.1968177101349013) internal successors, (3460), 2954 states have internal predecessors, (3460), 1027 states have call successors, (1027), 320 states have call predecessors, (1027), 335 states have return successors, (1064), 1035 states have call predecessors, (1064), 1026 states have call successors, (1064) [2022-07-12 17:13:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5551 transitions. [2022-07-12 17:13:48,230 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5551 transitions. Word has length 403 [2022-07-12 17:13:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:48,230 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 5551 transitions. [2022-07-12 17:13:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2022-07-12 17:13:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5551 transitions. [2022-07-12 17:13:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-07-12 17:13:48,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:48,235 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:48,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:48,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 17:13:48,436 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash -52787875, now seen corresponding path program 1 times [2022-07-12 17:13:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022161856] [2022-07-12 17:13:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:13:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:13:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:13:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:13:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:13:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:13:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:13:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:13:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:13:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:13:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:13:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:13:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 17:13:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:13:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:13:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:13:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 17:13:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 17:13:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 17:13:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:13:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 17:13:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 17:13:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 17:13:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 17:13:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 17:13:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-12 17:13:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-12 17:13:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 17:13:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:13:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 17:13:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 17:13:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-12 17:13:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-12 17:13:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-12 17:13:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-12 17:13:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 17:13:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:13:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 17:13:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 17:13:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 17:13:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 17:13:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:13:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-07-12 17:13:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:13:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:13:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2022-07-12 17:13:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022161856] [2022-07-12 17:13:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022161856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:49,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 17:13:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469563104] [2022-07-12 17:13:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:49,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 17:13:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 17:13:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-12 17:13:49,252 INFO L87 Difference]: Start difference. First operand 4255 states and 5551 transitions. Second operand has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2022-07-12 17:13:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:57,384 INFO L93 Difference]: Finished difference Result 10131 states and 13827 transitions. [2022-07-12 17:13:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 17:13:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) Word has length 384 [2022-07-12 17:13:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:57,402 INFO L225 Difference]: With dead ends: 10131 [2022-07-12 17:13:57,402 INFO L226 Difference]: Without dead ends: 7001 [2022-07-12 17:13:57,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 17:13:57,412 INFO L413 NwaCegarLoop]: 1616 mSDtfsCounter, 3601 mSDsluCounter, 12920 mSDsCounter, 0 mSdLazyCounter, 12309 mSolverCounterSat, 3241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3714 SdHoareTripleChecker+Valid, 14536 SdHoareTripleChecker+Invalid, 15550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3241 IncrementalHoareTripleChecker+Valid, 12309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:57,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3714 Valid, 14536 Invalid, 15550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3241 Valid, 12309 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 17:13:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-12 17:13:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 4473. [2022-07-12 17:13:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 3033 states have (on average 1.1928783382789319) internal successors, (3618), 3090 states have internal predecessors, (3618), 1103 states have call successors, (1103), 320 states have call predecessors, (1103), 335 states have return successors, (1140), 1109 states have call predecessors, (1140), 1102 states have call successors, (1140) [2022-07-12 17:13:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 5861 transitions. [2022-07-12 17:13:57,962 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 5861 transitions. Word has length 384 [2022-07-12 17:13:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:57,962 INFO L495 AbstractCegarLoop]: Abstraction has 4473 states and 5861 transitions. [2022-07-12 17:13:57,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2022-07-12 17:13:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 5861 transitions. [2022-07-12 17:13:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-07-12 17:13:57,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:57,969 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 14, 14, 14, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:57,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 17:13:57,970 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:13:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 507130644, now seen corresponding path program 1 times [2022-07-12 17:13:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:57,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609172572] [2022-07-12 17:13:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:58,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:13:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979371704] [2022-07-12 17:13:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:13:58,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:13:58,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:13:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 17:13:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:58,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 3248 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:13:58,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-07-12 17:13:59,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:59,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609172572] [2022-07-12 17:13:59,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:13:59,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979371704] [2022-07-12 17:13:59,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979371704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:59,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:59,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 17:13:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405356331] [2022-07-12 17:13:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:59,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:13:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:13:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:13:59,031 INFO L87 Difference]: Start difference. First operand 4473 states and 5861 transitions. Second operand has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2022-07-12 17:14:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:00,580 INFO L93 Difference]: Finished difference Result 9314 states and 12604 transitions. [2022-07-12 17:14:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 17:14:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 476 [2022-07-12 17:14:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:00,594 INFO L225 Difference]: With dead ends: 9314 [2022-07-12 17:14:00,594 INFO L226 Difference]: Without dead ends: 6071 [2022-07-12 17:14:00,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-07-12 17:14:00,609 INFO L413 NwaCegarLoop]: 1656 mSDtfsCounter, 1846 mSDsluCounter, 19056 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 20712 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:00,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 20712 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 17:14:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2022-07-12 17:14:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3825. [2022-07-12 17:14:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3825 states, 2608 states have (on average 1.1982361963190185) internal successors, (3125), 2664 states have internal predecessors, (3125), 923 states have call successors, (923), 275 states have call predecessors, (923), 292 states have return successors, (960), 936 states have call predecessors, (960), 922 states have call successors, (960) [2022-07-12 17:14:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5008 transitions. [2022-07-12 17:14:01,064 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5008 transitions. Word has length 476 [2022-07-12 17:14:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:01,065 INFO L495 AbstractCegarLoop]: Abstraction has 3825 states and 5008 transitions. [2022-07-12 17:14:01,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2022-07-12 17:14:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5008 transitions. [2022-07-12 17:14:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-07-12 17:14:01,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:01,071 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 10, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:14:01,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-12 17:14:01,288 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:14:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2012579196, now seen corresponding path program 1 times [2022-07-12 17:14:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:01,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053286576] [2022-07-12 17:14:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:01,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784362387] [2022-07-12 17:14:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:01,354 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:01,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 17:14:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:02,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 3433 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 17:14:02,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 66 proven. 314 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2022-07-12 17:14:02,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:14:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-07-12 17:14:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:03,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053286576] [2022-07-12 17:14:03,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:03,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784362387] [2022-07-12 17:14:03,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784362387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:14:03,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:14:03,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-07-12 17:14:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445050424] [2022-07-12 17:14:03,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:14:03,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:14:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:14:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:14:03,456 INFO L87 Difference]: Start difference. First operand 3825 states and 5008 transitions. Second operand has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2022-07-12 17:14:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:07,195 INFO L93 Difference]: Finished difference Result 5005 states and 6530 transitions. [2022-07-12 17:14:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:14:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 528 [2022-07-12 17:14:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:07,210 INFO L225 Difference]: With dead ends: 5005 [2022-07-12 17:14:07,210 INFO L226 Difference]: Without dead ends: 5003 [2022-07-12 17:14:07,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:14:07,213 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 2270 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 1295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 3845 SdHoareTripleChecker+Invalid, 5247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1295 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:07,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 3845 Invalid, 5247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1295 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:14:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-07-12 17:14:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 4958. [2022-07-12 17:14:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4958 states, 3374 states have (on average 1.1944279786603438) internal successors, (4030), 3447 states have internal predecessors, (4030), 1200 states have call successors, (1200), 357 states have call predecessors, (1200), 382 states have return successors, (1249), 1217 states have call predecessors, (1249), 1199 states have call successors, (1249) [2022-07-12 17:14:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 6479 transitions. [2022-07-12 17:14:07,755 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 6479 transitions. Word has length 528 [2022-07-12 17:14:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:07,756 INFO L495 AbstractCegarLoop]: Abstraction has 4958 states and 6479 transitions. [2022-07-12 17:14:07,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2022-07-12 17:14:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 6479 transitions. [2022-07-12 17:14:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-07-12 17:14:07,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:07,760 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:14:07,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 17:14:07,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-12 17:14:07,961 INFO L420 AbstractCegarLoop]: === Iteration 41 === 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 26 more)] === [2022-07-12 17:14:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1663947809, now seen corresponding path program 1 times [2022-07-12 17:14:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:07,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027796813] [2022-07-12 17:14:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:08,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165612633] [2022-07-12 17:14:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:08,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:08,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:08,056 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:08,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 17:14:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:08,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 3893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:14:08,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2022-07-12 17:14:08,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:08,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:08,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027796813] [2022-07-12 17:14:08,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:08,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165612633] [2022-07-12 17:14:08,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165612633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:08,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:14:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529739502] [2022-07-12 17:14:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:08,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:14:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:14:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:08,993 INFO L87 Difference]: Start difference. First operand 4958 states and 6479 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2022-07-12 17:14:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:09,685 INFO L93 Difference]: Finished difference Result 9875 states and 12953 transitions. [2022-07-12 17:14:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:14:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 546 [2022-07-12 17:14:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:09,703 INFO L225 Difference]: With dead ends: 9875 [2022-07-12 17:14:09,703 INFO L226 Difference]: Without dead ends: 5302 [2022-07-12 17:14:09,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:09,717 INFO L413 NwaCegarLoop]: 1180 mSDtfsCounter, 74 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:09,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:14:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2022-07-12 17:14:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 4973. [2022-07-12 17:14:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4973 states, 3389 states have (on average 1.1935674240188847) internal successors, (4045), 3462 states have internal predecessors, (4045), 1200 states have call successors, (1200), 357 states have call predecessors, (1200), 382 states have return successors, (1249), 1217 states have call predecessors, (1249), 1199 states have call successors, (1249) [2022-07-12 17:14:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 6494 transitions. [2022-07-12 17:14:10,361 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 6494 transitions. Word has length 546 [2022-07-12 17:14:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:10,362 INFO L495 AbstractCegarLoop]: Abstraction has 4973 states and 6494 transitions. [2022-07-12 17:14:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2022-07-12 17:14:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 6494 transitions. [2022-07-12 17:14:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2022-07-12 17:14:10,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:10,370 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:10,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:10,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:10,571 INFO L420 AbstractCegarLoop]: === Iteration 42 === 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 26 more)] === [2022-07-12 17:14:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1674679240, now seen corresponding path program 1 times [2022-07-12 17:14:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:10,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69645909] [2022-07-12 17:14:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:10,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:10,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921853457] [2022-07-12 17:14:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:10,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:10,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 17:14:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:11,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 4796 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 17:14:11,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 1252 trivial. 0 not checked. [2022-07-12 17:14:12,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:12,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69645909] [2022-07-12 17:14:12,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:12,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921853457] [2022-07-12 17:14:12,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921853457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:12,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:12,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 17:14:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748242645] [2022-07-12 17:14:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:12,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:14:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:12,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:14:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:12,379 INFO L87 Difference]: Start difference. First operand 4973 states and 6494 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2022-07-12 17:14:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:12,934 INFO L93 Difference]: Finished difference Result 9492 states and 12401 transitions. [2022-07-12 17:14:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:14:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 721 [2022-07-12 17:14:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:12,945 INFO L225 Difference]: With dead ends: 9492 [2022-07-12 17:14:12,945 INFO L226 Difference]: Without dead ends: 4963 [2022-07-12 17:14:12,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:12,959 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 800 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:12,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1090 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:14:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2022-07-12 17:14:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4963. [2022-07-12 17:14:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4963 states, 3384 states have (on average 1.1908983451536643) internal successors, (4030), 3457 states have internal predecessors, (4030), 1195 states have call successors, (1195), 357 states have call predecessors, (1195), 382 states have return successors, (1244), 1212 states have call predecessors, (1244), 1194 states have call successors, (1244) [2022-07-12 17:14:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 6469 transitions. [2022-07-12 17:14:13,477 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 6469 transitions. Word has length 721 [2022-07-12 17:14:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:13,477 INFO L495 AbstractCegarLoop]: Abstraction has 4963 states and 6469 transitions. [2022-07-12 17:14:13,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2022-07-12 17:14:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 6469 transitions. [2022-07-12 17:14:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2022-07-12 17:14:13,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:13,486 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:13,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 17:14:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-12 17:14:13,699 INFO L420 AbstractCegarLoop]: === Iteration 43 === 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 26 more)] === [2022-07-12 17:14:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2060996514, now seen corresponding path program 1 times [2022-07-12 17:14:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655542348] [2022-07-12 17:14:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:13,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:13,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598887948] [2022-07-12 17:14:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:13,784 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:13,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 17:14:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:14,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 4836 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 17:14:14,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 699 proven. 1 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2022-07-12 17:14:15,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:14:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2022-07-12 17:14:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655542348] [2022-07-12 17:14:15,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598887948] [2022-07-12 17:14:15,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598887948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:14:15,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:14:15,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 17:14:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624768602] [2022-07-12 17:14:15,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:14:15,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:15,447 INFO L87 Difference]: Start difference. First operand 4963 states and 6469 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) [2022-07-12 17:14:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:16,622 INFO L93 Difference]: Finished difference Result 10757 states and 14193 transitions. [2022-07-12 17:14:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:14:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) Word has length 731 [2022-07-12 17:14:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:16,636 INFO L225 Difference]: With dead ends: 10757 [2022-07-12 17:14:16,636 INFO L226 Difference]: Without dead ends: 6180 [2022-07-12 17:14:16,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1460 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:16,643 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 487 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:16,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 4335 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 17:14:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2022-07-12 17:14:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 5263. [2022-07-12 17:14:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 3594 states have (on average 1.1922648859209795) internal successors, (4285), 3667 states have internal predecessors, (4285), 1285 states have call successors, (1285), 357 states have call predecessors, (1285), 382 states have return successors, (1334), 1302 states have call predecessors, (1334), 1284 states have call successors, (1334) [2022-07-12 17:14:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 6904 transitions. [2022-07-12 17:14:17,223 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 6904 transitions. Word has length 731 [2022-07-12 17:14:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:17,223 INFO L495 AbstractCegarLoop]: Abstraction has 5263 states and 6904 transitions. [2022-07-12 17:14:17,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) [2022-07-12 17:14:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 6904 transitions. [2022-07-12 17:14:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2022-07-12 17:14:17,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:17,235 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:14:17,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:17,440 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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 26 more)] === [2022-07-12 17:14:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash 487123768, now seen corresponding path program 1 times [2022-07-12 17:14:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:17,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725612186] [2022-07-12 17:14:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:17,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:17,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205292567] [2022-07-12 17:14:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:17,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:17,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:17,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:17,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 17:14:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:19,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 6566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:14:19,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 1836 proven. 64 refuted. 0 times theorem prover too weak. 2026 trivial. 0 not checked. [2022-07-12 17:14:19,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:14:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 3859 trivial. 0 not checked. [2022-07-12 17:14:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725612186] [2022-07-12 17:14:20,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205292567] [2022-07-12 17:14:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205292567] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:14:20,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:14:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-12 17:14:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846445066] [2022-07-12 17:14:20,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:14:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:14:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:14:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:20,024 INFO L87 Difference]: Start difference. First operand 5263 states and 6904 transitions. Second operand has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) [2022-07-12 17:14:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:22,022 INFO L93 Difference]: Finished difference Result 12383 states and 16552 transitions. [2022-07-12 17:14:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:14:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) Word has length 1070 [2022-07-12 17:14:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:22,042 INFO L225 Difference]: With dead ends: 12383 [2022-07-12 17:14:22,042 INFO L226 Difference]: Without dead ends: 7536 [2022-07-12 17:14:22,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2138 GetRequests, 2130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:22,051 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 1258 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:22,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 4712 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:14:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2022-07-12 17:14:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 5663. [2022-07-12 17:14:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 3874 states have (on average 1.1938564790913784) internal successors, (4625), 3947 states have internal predecessors, (4625), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1422 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-12 17:14:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 7484 transitions. [2022-07-12 17:14:22,779 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 7484 transitions. Word has length 1070 [2022-07-12 17:14:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:22,780 INFO L495 AbstractCegarLoop]: Abstraction has 5663 states and 7484 transitions. [2022-07-12 17:14:22,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) [2022-07-12 17:14:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 7484 transitions. [2022-07-12 17:14:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1523 [2022-07-12 17:14:22,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:22,800 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:14:22,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-12 17:14:23,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:23,001 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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 26 more)] === [2022-07-12 17:14:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2099751536, now seen corresponding path program 2 times [2022-07-12 17:14:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:23,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020675829] [2022-07-12 17:14:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:23,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:23,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826754806] [2022-07-12 17:14:23,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:14:23,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:23,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:23,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 17:14:25,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:14:25,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:14:25,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 8858 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 17:14:25,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9784 backedges. 1512 proven. 0 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2022-07-12 17:14:25,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020675829] [2022-07-12 17:14:25,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826754806] [2022-07-12 17:14:25,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826754806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:25,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:25,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:14:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846799886] [2022-07-12 17:14:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:25,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:14:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:14:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:14:25,115 INFO L87 Difference]: Start difference. First operand 5663 states and 7484 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2022-07-12 17:14:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:26,160 INFO L93 Difference]: Finished difference Result 11416 states and 15129 transitions. [2022-07-12 17:14:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:14:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 1522 [2022-07-12 17:14:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:26,174 INFO L225 Difference]: With dead ends: 11416 [2022-07-12 17:14:26,174 INFO L226 Difference]: Without dead ends: 6122 [2022-07-12 17:14:26,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1523 GetRequests, 1520 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:14:26,185 INFO L413 NwaCegarLoop]: 1267 mSDtfsCounter, 131 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 3536 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:26,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 3536 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:14:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2022-07-12 17:14:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5669. [2022-07-12 17:14:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 3880 states have (on average 1.1935567010309278) internal successors, (4631), 3953 states have internal predecessors, (4631), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1422 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-12 17:14:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7490 transitions. [2022-07-12 17:14:26,834 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7490 transitions. Word has length 1522 [2022-07-12 17:14:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:26,834 INFO L495 AbstractCegarLoop]: Abstraction has 5669 states and 7490 transitions. [2022-07-12 17:14:26,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2022-07-12 17:14:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7490 transitions. [2022-07-12 17:14:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2022-07-12 17:14:26,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:26,853 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:14:26,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:27,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-12 17:14:27,054 INFO L420 AbstractCegarLoop]: === Iteration 46 === 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 26 more)] === [2022-07-12 17:14:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1483846966, now seen corresponding path program 1 times [2022-07-12 17:14:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:27,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251814257] [2022-07-12 17:14:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:27,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:27,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015129788] [2022-07-12 17:14:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:27,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:27,183 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:27,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 17:14:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 8941 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 17:14:29,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 1590 proven. 0 refuted. 0 times theorem prover too weak. 8248 trivial. 0 not checked. [2022-07-12 17:14:29,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251814257] [2022-07-12 17:14:29,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015129788] [2022-07-12 17:14:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015129788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:29,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:29,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:14:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642299260] [2022-07-12 17:14:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:29,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:14:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:14:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:14:29,294 INFO L87 Difference]: Start difference. First operand 5669 states and 7490 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) [2022-07-12 17:14:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:30,359 INFO L93 Difference]: Finished difference Result 11537 states and 15305 transitions. [2022-07-12 17:14:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:14:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) Word has length 1542 [2022-07-12 17:14:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:30,382 INFO L225 Difference]: With dead ends: 11537 [2022-07-12 17:14:30,382 INFO L226 Difference]: Without dead ends: 6227 [2022-07-12 17:14:30,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1548 GetRequests, 1538 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:14:30,396 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 383 mSDsluCounter, 7154 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 8392 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:30,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 8392 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 17:14:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2022-07-12 17:14:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5676. [2022-07-12 17:14:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 3887 states have (on average 1.193208129662979) internal successors, (4638), 3962 states have internal predecessors, (4638), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1420 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-12 17:14:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 7497 transitions. [2022-07-12 17:14:31,110 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 7497 transitions. Word has length 1542 [2022-07-12 17:14:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:31,111 INFO L495 AbstractCegarLoop]: Abstraction has 5676 states and 7497 transitions. [2022-07-12 17:14:31,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) [2022-07-12 17:14:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 7497 transitions. [2022-07-12 17:14:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1600 [2022-07-12 17:14:31,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:31,131 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:31,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-12 17:14:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:31,331 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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 26 more)] === [2022-07-12 17:14:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 809345631, now seen corresponding path program 1 times [2022-07-12 17:14:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022976796] [2022-07-12 17:14:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:31,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:31,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581461466] [2022-07-12 17:14:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:31,461 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:31,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 17:14:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:33,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 9264 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 17:14:33,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10228 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 9829 trivial. 0 not checked. [2022-07-12 17:14:33,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:33,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022976796] [2022-07-12 17:14:33,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:33,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581461466] [2022-07-12 17:14:33,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581461466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:33,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:33,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 17:14:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651456341] [2022-07-12 17:14:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:33,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:14:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:14:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:14:33,608 INFO L87 Difference]: Start difference. First operand 5676 states and 7497 transitions. Second operand has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2022-07-12 17:14:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:35,286 INFO L93 Difference]: Finished difference Result 8797 states and 11930 transitions. [2022-07-12 17:14:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 17:14:35,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 1599 [2022-07-12 17:14:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:35,305 INFO L225 Difference]: With dead ends: 8797 [2022-07-12 17:14:35,305 INFO L226 Difference]: Without dead ends: 5193 [2022-07-12 17:14:35,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1616 GetRequests, 1590 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-07-12 17:14:35,315 INFO L413 NwaCegarLoop]: 1914 mSDtfsCounter, 2525 mSDsluCounter, 19350 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2525 SdHoareTripleChecker+Valid, 21264 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2525 Valid, 21264 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:14:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2022-07-12 17:14:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 2364. [2022-07-12 17:14:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 1616 states have (on average 1.1862623762376239) internal successors, (1917), 1643 states have internal predecessors, (1917), 578 states have call successors, (578), 157 states have call predecessors, (578), 168 states have return successors, (594), 590 states have call predecessors, (594), 577 states have call successors, (594) [2022-07-12 17:14:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3089 transitions. [2022-07-12 17:14:35,651 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3089 transitions. Word has length 1599 [2022-07-12 17:14:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:35,652 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 3089 transitions. [2022-07-12 17:14:35,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2022-07-12 17:14:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3089 transitions. [2022-07-12 17:14:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2022-07-12 17:14:35,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:35,678 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:35,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:35,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:35,879 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:14:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash -390783929, now seen corresponding path program 1 times [2022-07-12 17:14:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:35,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389602877] [2022-07-12 17:14:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:36,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:36,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954392784] [2022-07-12 17:14:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:36,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:36,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:36,034 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:36,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 17:14:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:38,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 11049 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 17:14:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13966 backedges. 1491 proven. 0 refuted. 0 times theorem prover too weak. 12475 trivial. 0 not checked. [2022-07-12 17:14:38,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:14:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389602877] [2022-07-12 17:14:38,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954392784] [2022-07-12 17:14:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954392784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:38,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:14:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773911305] [2022-07-12 17:14:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:14:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:14:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:38,501 INFO L87 Difference]: Start difference. First operand 2364 states and 3089 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2022-07-12 17:14:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:39,026 INFO L93 Difference]: Finished difference Result 4639 states and 6096 transitions. [2022-07-12 17:14:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:14:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) Word has length 1939 [2022-07-12 17:14:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:39,032 INFO L225 Difference]: With dead ends: 4639 [2022-07-12 17:14:39,032 INFO L226 Difference]: Without dead ends: 2458 [2022-07-12 17:14:39,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1938 GetRequests, 1937 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:14:39,037 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 40 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:39,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:14:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2022-07-12 17:14:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2366. [2022-07-12 17:14:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1618 states have (on average 1.1860321384425216) internal successors, (1919), 1645 states have internal predecessors, (1919), 578 states have call successors, (578), 157 states have call predecessors, (578), 168 states have return successors, (594), 590 states have call predecessors, (594), 577 states have call successors, (594) [2022-07-12 17:14:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3091 transitions. [2022-07-12 17:14:39,340 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3091 transitions. Word has length 1939 [2022-07-12 17:14:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:39,340 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 3091 transitions. [2022-07-12 17:14:39,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2022-07-12 17:14:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3091 transitions. [2022-07-12 17:14:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1943 [2022-07-12 17:14:39,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:39,367 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:39,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 17:14:39,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:39,568 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:14:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1932668400, now seen corresponding path program 1 times [2022-07-12 17:14:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:39,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362525060] [2022-07-12 17:14:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:39,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:14:39,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768225446] [2022-07-12 17:14:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:39,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:14:39,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:14:39,720 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:14:39,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 17:14:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:42,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 11052 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-12 17:14:42,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:14:42,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:14:42,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:43,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,266 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 17:14:43,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 17:14:43,315 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 17:14:43,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 17:14:43,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:43,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 17:14:43,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,609 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 17:14:43,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 17:14:43,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:43,813 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 17:14:43,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 17:14:44,301 INFO L356 Elim1Store]: treesize reduction 679, result has 12.6 percent of original size [2022-07-12 17:14:44,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 129 [2022-07-12 17:14:46,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 17:14:46,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-12 17:14:46,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 17:14:46,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:46,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:46,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:46,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:46,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:46,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:46,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:47,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:47,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:14:47,723 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 17:14:47,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 17:14:47,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:47,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:14:47,776 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-12 17:14:47,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 33 [2022-07-12 17:14:48,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:14:48,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 17:14:48,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 17:14:48,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 17:14:48,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:48,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:48,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:48,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:48,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:48,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:48,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:49,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:14:49,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:14:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:14:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:14:49,432 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-12 17:14:49,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2022-07-12 17:14:49,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:49,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:49,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:50,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 17:14:50,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 17:14:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13966 backedges. 1639 proven. 302 refuted. 0 times theorem prover too weak. 12025 trivial. 0 not checked. [2022-07-12 17:14:50,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:14:51,501 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_16732 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_16732) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2022-07-12 17:14:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:51,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362525060] [2022-07-12 17:14:51,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:14:51,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768225446] [2022-07-12 17:14:51,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768225446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:14:51,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:14:51,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2022-07-12 17:14:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543575007] [2022-07-12 17:14:51,511 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 17:14:51,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 17:14:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 17:14:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2109, Unknown=52, NotChecked=94, Total=2450 [2022-07-12 17:14:51,515 INFO L87 Difference]: Start difference. First operand 2366 states and 3091 transitions. Second operand has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) [2022-07-12 17:15:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:00,929 INFO L93 Difference]: Finished difference Result 6270 states and 8115 transitions. [2022-07-12 17:15:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 17:15:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) Word has length 1942 [2022-07-12 17:15:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:00,937 INFO L225 Difference]: With dead ends: 6270 [2022-07-12 17:15:00,937 INFO L226 Difference]: Without dead ends: 4087 [2022-07-12 17:15:00,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3599 GetRequests, 3535 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=263, Invalid=2874, Unknown=59, NotChecked=110, Total=3306 [2022-07-12 17:15:00,942 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 1317 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 18644 SdHoareTripleChecker+Invalid, 20400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15807 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:00,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 18644 Invalid, 20400 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [197 Valid, 4396 Invalid, 0 Unknown, 15807 Unchecked, 8.1s Time] [2022-07-12 17:15:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2022-07-12 17:15:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4005. [2022-07-12 17:15:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 2734 states have (on average 1.1693489392831016) internal successors, (3197), 2773 states have internal predecessors, (3197), 952 states have call successors, (952), 300 states have call predecessors, (952), 317 states have return successors, (984), 971 states have call predecessors, (984), 951 states have call successors, (984) [2022-07-12 17:15:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5133 transitions. [2022-07-12 17:15:01,465 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5133 transitions. Word has length 1942 [2022-07-12 17:15:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:01,465 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5133 transitions. [2022-07-12 17:15:01,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) [2022-07-12 17:15:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5133 transitions. [2022-07-12 17:15:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1945 [2022-07-12 17:15:01,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:01,495 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:15:01,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-12 17:15:01,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-12 17:15:01,697 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-12 17:15:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1021379445, now seen corresponding path program 1 times [2022-07-12 17:15:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:01,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438481793] [2022-07-12 17:15:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:01,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:15:01,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673190977] [2022-07-12 17:15:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:15:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:15:01,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:15:01,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 17:15:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:04,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 11069 conjuncts, 238 conjunts are in the unsatisfiable core [2022-07-12 17:15:04,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:15:04,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 17:15:04,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 17:15:05,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,235 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 17:15:05,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 17:15:05,283 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 17:15:05,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 17:15:05,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 17:15:05,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 17:15:05,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,607 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 17:15:05,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-12 17:15:05,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 17:15:05,894 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 17:15:05,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 38 [2022-07-12 17:15:06,489 INFO L356 Elim1Store]: treesize reduction 660, result has 15.1 percent of original size [2022-07-12 17:15:06,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 132 [2022-07-12 17:15:06,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 17:15:06,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-12 17:15:06,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-12 17:15:07,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:07,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:07,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 17:15:07,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:07,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 17:15:07,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:07,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 17:15:07,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:07,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 17:15:08,037 INFO L356 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-07-12 17:15:08,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-12 17:15:08,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 17:15:08,068 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 17:15:08,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-12 17:15:08,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 17:15:08,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 17:15:08,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 17:15:08,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 39 [2022-07-12 17:15:08,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 17:15:08,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:15:08,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:08,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:15:08,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:08,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:15:08,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:08,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:15:09,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 17:15:09,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 17:15:09,478 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 17:15:09,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 47 [2022-07-12 17:15:09,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 17:15:09,555 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-07-12 17:15:09,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 58 [2022-07-12 17:15:09,791 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-12 17:15:09,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43