./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.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 a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 04:02:44,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:02:44,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:02:44,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:02:44,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:02:44,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:02:44,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:02:44,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:02:44,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:02:44,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:02:44,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:02:44,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:02:44,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:02:44,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:02:44,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:02:44,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:02:44,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:02:44,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:02:44,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:02:44,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:02:44,547 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:02:44,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:02:44,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:02:44,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:02:44,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:02:44,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:02:44,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:02:44,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:02:44,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:02:44,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:02:44,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:02:44,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:02:44,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:02:44,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:02:44,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:02:44,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:02:44,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:02:44,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:02:44,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:02:44,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:02:44,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:02:44,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:02:44,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:02:44,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:02:44,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:02:44,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:02:44,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:02:44,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:02:44,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:02:44,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:02:44,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:02:44,588 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:02:44,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:02:44,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:02:44,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:02:44,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:02:44,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:02:44,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:02:44,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:02:44,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:02:44,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:02:44,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:02:44,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:02:44,593 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 -> a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd [2022-07-20 04:02:44,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:02:44,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:02:44,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:02:44,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:02:44,793 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:02:44,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-20 04:02:44,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1399d3cb/eabaac4f836449999826573bb4e7bd40/FLAGaafd748ea [2022-07-20 04:02:45,408 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:02:45,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-20 04:02:45,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1399d3cb/eabaac4f836449999826573bb4e7bd40/FLAGaafd748ea [2022-07-20 04:02:45,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1399d3cb/eabaac4f836449999826573bb4e7bd40 [2022-07-20 04:02:45,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:02:45,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:02:45,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:02:45,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:02:45,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:02:45,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:02:45" (1/1) ... [2022-07-20 04:02:45,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ac60a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:45, skipping insertion in model container [2022-07-20 04:02:45,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:02:45" (1/1) ... [2022-07-20 04:02:45,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:02:45,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:02:48,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-07-20 04:02:48,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-07-20 04:02:48,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-07-20 04:02:48,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-07-20 04:02:48,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-07-20 04:02:48,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-07-20 04:02:48,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-07-20 04:02:48,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-07-20 04:02:48,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-07-20 04:02:48,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-07-20 04:02:48,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-07-20 04:02:48,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-07-20 04:02:48,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-07-20 04:02:48,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-07-20 04:02:48,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-07-20 04:02:48,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-07-20 04:02:48,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-07-20 04:02:48,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-07-20 04:02:48,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-07-20 04:02:48,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-07-20 04:02:48,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-07-20 04:02:48,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-07-20 04:02:48,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-07-20 04:02:48,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-07-20 04:02:48,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-07-20 04:02:48,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-07-20 04:02:48,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-07-20 04:02:48,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-07-20 04:02:48,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-07-20 04:02:48,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-07-20 04:02:48,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-07-20 04:02:48,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-07-20 04:02:48,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-07-20 04:02:48,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-07-20 04:02:48,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-07-20 04:02:48,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-07-20 04:02:48,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-07-20 04:02:48,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-07-20 04:02:48,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-07-20 04:02:48,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-07-20 04:02:48,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-07-20 04:02:48,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-07-20 04:02:48,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-07-20 04:02:48,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-07-20 04:02:48,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-07-20 04:02:48,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-07-20 04:02:48,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-07-20 04:02:48,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-07-20 04:02:48,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-07-20 04:02:48,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-07-20 04:02:48,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-07-20 04:02:48,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-07-20 04:02:48,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-07-20 04:02:48,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-07-20 04:02:48,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-07-20 04:02:48,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-07-20 04:02:48,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-07-20 04:02:48,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-07-20 04:02:48,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-07-20 04:02:48,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-07-20 04:02:48,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-07-20 04:02:48,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-07-20 04:02:48,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-07-20 04:02:48,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-07-20 04:02:48,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-07-20 04:02:48,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-07-20 04:02:48,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-07-20 04:02:48,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-07-20 04:02:48,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-07-20 04:02:48,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-07-20 04:02:48,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-07-20 04:02:48,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-07-20 04:02:48,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-07-20 04:02:48,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-07-20 04:02:48,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-07-20 04:02:48,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-07-20 04:02:48,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-07-20 04:02:48,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-07-20 04:02:48,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-07-20 04:02:48,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-07-20 04:02:48,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-07-20 04:02:48,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-07-20 04:02:48,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-07-20 04:02:48,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-07-20 04:02:48,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-07-20 04:02:48,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-07-20 04:02:48,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-07-20 04:02:48,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-07-20 04:02:48,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:02:48,366 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:02:48,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-07-20 04:02:48,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-07-20 04:02:48,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-07-20 04:02:48,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-07-20 04:02:48,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-07-20 04:02:48,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-07-20 04:02:48,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-07-20 04:02:48,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-07-20 04:02:48,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-07-20 04:02:48,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-07-20 04:02:48,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-07-20 04:02:48,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-07-20 04:02:48,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-07-20 04:02:48,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-07-20 04:02:48,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-07-20 04:02:48,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-07-20 04:02:48,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-07-20 04:02:48,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-07-20 04:02:48,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-07-20 04:02:48,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-07-20 04:02:48,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-07-20 04:02:48,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-07-20 04:02:48,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-07-20 04:02:48,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-07-20 04:02:48,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-07-20 04:02:48,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-07-20 04:02:48,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-07-20 04:02:48,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-07-20 04:02:48,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-07-20 04:02:48,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-07-20 04:02:48,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-07-20 04:02:48,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-07-20 04:02:48,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-07-20 04:02:48,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-07-20 04:02:48,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-07-20 04:02:48,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-07-20 04:02:48,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-07-20 04:02:48,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-07-20 04:02:48,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-07-20 04:02:48,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-07-20 04:02:48,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-07-20 04:02:48,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-07-20 04:02:48,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-07-20 04:02:48,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-07-20 04:02:48,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-07-20 04:02:48,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-07-20 04:02:48,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-07-20 04:02:48,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-07-20 04:02:48,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-07-20 04:02:48,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-07-20 04:02:48,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-07-20 04:02:48,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-07-20 04:02:48,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-07-20 04:02:48,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-07-20 04:02:48,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-07-20 04:02:48,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-07-20 04:02:48,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-07-20 04:02:48,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-07-20 04:02:48,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-07-20 04:02:48,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-07-20 04:02:48,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-07-20 04:02:48,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-07-20 04:02:48,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-07-20 04:02:48,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-07-20 04:02:48,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-07-20 04:02:48,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-07-20 04:02:48,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-07-20 04:02:48,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-07-20 04:02:48,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-07-20 04:02:48,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-07-20 04:02:48,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-07-20 04:02:48,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-07-20 04:02:48,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-07-20 04:02:48,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-07-20 04:02:48,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-07-20 04:02:48,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-07-20 04:02:48,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-07-20 04:02:48,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-07-20 04:02:48,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-07-20 04:02:48,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-07-20 04:02:48,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-07-20 04:02:48,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-07-20 04:02:48,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-07-20 04:02:48,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-07-20 04:02:48,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-07-20 04:02:48,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-07-20 04:02:48,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-07-20 04:02:48,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-07-20 04:02:48,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:02:48,951 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:02:48,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48 WrapperNode [2022-07-20 04:02:48,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:02:48,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:02:48,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:02:48,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:02:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,176 INFO L137 Inliner]: procedures = 641, calls = 2563, calls flagged for inlining = 300, calls inlined = 195, statements flattened = 3322 [2022-07-20 04:02:49,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:02:49,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:02:49,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:02:49,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:02:49,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:02:49,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:02:49,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:02:49,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:02:49,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (1/1) ... [2022-07-20 04:02:49,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:02:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:02:49,332 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-20 04:02:49,359 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-20 04:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:02:49,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:02:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_open [2022-07-20 04:02:49,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_open [2022-07-20 04:02:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:02:49,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:02:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:02:49,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:02:49,398 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-20 04:02:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-20 04:02:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:02:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:02:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-20 04:02:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-20 04:02:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 04:02:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 04:02:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-20 04:02:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-20 04:02:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:02:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:02:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:02:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:02:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-20 04:02:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-20 04:02:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_reset_module [2022-07-20 04:02:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_reset_module [2022-07-20 04:02:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_bus_state [2022-07-20 04:02:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_bus_state [2022-07-20 04:02:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:02:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:02:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:02:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:02:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:02:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:02:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-20 04:02:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-20 04:02:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:02:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_buserror [2022-07-20 04:02:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_buserror [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:02:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 04:02:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_remove [2022-07-20 04:02:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_remove [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-20 04:02:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-20 04:02:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:02:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:02:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:02:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:02:49,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:02:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 04:02:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 04:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:02:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:02:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_txok [2022-07-20 04:02:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_txok [2022-07-20 04:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_termination [2022-07-20 04:02:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_termination [2022-07-20 04:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_msg [2022-07-20 04:02:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_msg [2022-07-20 04:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_page [2022-07-20 04:02:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_page [2022-07-20 04:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:02:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:02:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_inquiry [2022-07-20 04:02:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_inquiry [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:02:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:02:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:02:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-20 04:02:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-20 04:02:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-07-20 04:02:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-07-20 04:02:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 04:02:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 04:02:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:02:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:02:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-20 04:02:49,407 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-20 04:02:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:02:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:02:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_fromio [2022-07-20 04:02:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_fromio [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:02:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:02:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-07-20 04:02:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_stop [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_stop [2022-07-20 04:02:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 04:02:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:02:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 04:02:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_127 [2022-07-20 04:02:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_127 [2022-07-20 04:02:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:02:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:02:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:02:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:02:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:02:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:02:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-20 04:02:49,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_probe [2022-07-20 04:02:49,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_probe [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-07-20 04:02:49,411 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-20 04:02:49,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-20 04:02:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:02:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:02:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 04:02:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 04:02:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-20 04:02:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-20 04:02:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:02:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:02:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-20 04:02:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-20 04:02:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-20 04:02:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:02:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:02:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:02:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 04:02:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:02:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:02:49,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:02:49,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:02:49,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:02:49,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:02:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:02:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:02:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:02:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-20 04:02:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-20 04:02:49,959 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:02:49,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:02:50,160 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:02:52,230 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:02:52,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:02:52,241 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 04:02:52,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:02:52 BoogieIcfgContainer [2022-07-20 04:02:52,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:02:52,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:02:52,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:02:52,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:02:52,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:02:45" (1/3) ... [2022-07-20 04:02:52,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68be0808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:02:52, skipping insertion in model container [2022-07-20 04:02:52,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:48" (2/3) ... [2022-07-20 04:02:52,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68be0808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:02:52, skipping insertion in model container [2022-07-20 04:02:52,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:02:52" (3/3) ... [2022-07-20 04:02:52,250 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-20 04:02:52,259 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:02:52,260 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-20 04:02:52,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:02:52,308 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@13e22588, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10ce7276 [2022-07-20 04:02:52,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-20 04:02:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 846 states have (on average 1.2647754137115839) internal successors, (1070), 893 states have internal predecessors, (1070), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2022-07-20 04:02:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 04:02:52,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:52,323 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-20 04:02:52,323 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 27 more)] === [2022-07-20 04:02:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash 449709992, now seen corresponding path program 1 times [2022-07-20 04:02:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879054631] [2022-07-20 04:02:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:02:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:02:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:02:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:02:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:02:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:02:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,807 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-20 04:02:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:52,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879054631] [2022-07-20 04:02:52,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879054631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:52,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:52,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684074388] [2022-07-20 04:02:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:52,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:52,835 INFO L87 Difference]: Start difference. First operand has 1261 states, 846 states have (on average 1.2647754137115839) internal successors, (1070), 893 states have internal predecessors, (1070), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) 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-20 04:02:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:58,736 INFO L93 Difference]: Finished difference Result 3717 states and 5232 transitions. [2022-07-20 04:02:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:02:58,739 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-20 04:02:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:58,778 INFO L225 Difference]: With dead ends: 3717 [2022-07-20 04:02:58,778 INFO L226 Difference]: Without dead ends: 2453 [2022-07-20 04:02:58,793 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-20 04:02:58,797 INFO L413 NwaCegarLoop]: 2008 mSDtfsCounter, 3532 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 2167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3609 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 6328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2167 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:58,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3609 Valid, 3209 Invalid, 6328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2167 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-20 04:02:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2022-07-20 04:02:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2254. [2022-07-20 04:02:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 1539 states have (on average 1.2267706302794021) internal successors, (1888), 1598 states have internal predecessors, (1888), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-20 04:02:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3020 transitions. [2022-07-20 04:02:58,968 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3020 transitions. Word has length 64 [2022-07-20 04:02:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:58,968 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3020 transitions. [2022-07-20 04:02:58,969 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-20 04:02:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3020 transitions. [2022-07-20 04:02:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 04:02:58,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:58,971 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-20 04:02:58,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:02:58,972 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 27 more)] === [2022-07-20 04:02:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash -733384379, now seen corresponding path program 1 times [2022-07-20 04:02:58,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:58,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348463997] [2022-07-20 04:02:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:58,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:02:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:02:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:02:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:02:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:02:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:02:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:02:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,141 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-20 04:02:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:59,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348463997] [2022-07-20 04:02:59,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348463997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:59,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:59,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261033959] [2022-07-20 04:02:59,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:59,145 INFO L87 Difference]: Start difference. First operand 2254 states and 3020 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-20 04:03:01,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:03,314 INFO L93 Difference]: Finished difference Result 2254 states and 3020 transitions. [2022-07-20 04:03:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:03,315 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-20 04:03:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:03,324 INFO L225 Difference]: With dead ends: 2254 [2022-07-20 04:03:03,325 INFO L226 Difference]: Without dead ends: 2252 [2022-07-20 04:03:03,326 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-20 04:03:03,326 INFO L413 NwaCegarLoop]: 1428 mSDtfsCounter, 2661 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:03,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 2266 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:03:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-07-20 04:03:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2022-07-20 04:03:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 1538 states have (on average 1.2262678803641092) internal successors, (1886), 1596 states have internal predecessors, (1886), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-20 04:03:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3018 transitions. [2022-07-20 04:03:03,392 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3018 transitions. Word has length 70 [2022-07-20 04:03:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:03,393 INFO L495 AbstractCegarLoop]: Abstraction has 2252 states and 3018 transitions. [2022-07-20 04:03:03,393 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-20 04:03:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3018 transitions. [2022-07-20 04:03:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 04:03:03,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:03,395 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-20 04:03:03,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:03:03,395 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 27 more)] === [2022-07-20 04:03:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -574634998, now seen corresponding path program 1 times [2022-07-20 04:03:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:03,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614569660] [2022-07-20 04:03:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:03,593 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-20 04:03:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:03,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614569660] [2022-07-20 04:03:03,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614569660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:03,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:03,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227752601] [2022-07-20 04:03:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:03,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:03,595 INFO L87 Difference]: Start difference. First operand 2252 states and 3018 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-20 04:03:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:06,253 INFO L93 Difference]: Finished difference Result 2252 states and 3018 transitions. [2022-07-20 04:03:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:06,254 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-20 04:03:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:06,265 INFO L225 Difference]: With dead ends: 2252 [2022-07-20 04:03:06,265 INFO L226 Difference]: Without dead ends: 2250 [2022-07-20 04:03:06,267 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-20 04:03:06,269 INFO L413 NwaCegarLoop]: 1426 mSDtfsCounter, 2655 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:06,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 2264 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 04:03:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-07-20 04:03:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2250. [2022-07-20 04:03:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1537 states have (on average 1.2257644762524398) internal successors, (1884), 1594 states have internal predecessors, (1884), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-20 04:03:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3016 transitions. [2022-07-20 04:03:06,360 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3016 transitions. Word has length 76 [2022-07-20 04:03:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:06,361 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 3016 transitions. [2022-07-20 04:03:06,361 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-20 04:03:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3016 transitions. [2022-07-20 04:03:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 04:03:06,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:06,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, 1, 1, 1, 1, 1, 1] [2022-07-20 04:03:06,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:03:06,367 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 27 more)] === [2022-07-20 04:03:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1881413847, now seen corresponding path program 1 times [2022-07-20 04:03:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:06,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215086616] [2022-07-20 04:03:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:06,571 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-20 04:03:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:06,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215086616] [2022-07-20 04:03:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215086616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366493353] [2022-07-20 04:03:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:06,574 INFO L87 Difference]: Start difference. First operand 2250 states and 3016 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-20 04:03:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:09,762 INFO L93 Difference]: Finished difference Result 2250 states and 3016 transitions. [2022-07-20 04:03:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:09,762 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-20 04:03:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:09,770 INFO L225 Difference]: With dead ends: 2250 [2022-07-20 04:03:09,770 INFO L226 Difference]: Without dead ends: 2248 [2022-07-20 04:03:09,773 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-20 04:03:09,775 INFO L413 NwaCegarLoop]: 1424 mSDtfsCounter, 2649 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2745 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:09,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2745 Valid, 2262 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:03:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-07-20 04:03:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2248. [2022-07-20 04:03:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1536 states have (on average 1.2252604166666667) internal successors, (1882), 1592 states have internal predecessors, (1882), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-20 04:03:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3014 transitions. [2022-07-20 04:03:09,836 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3014 transitions. Word has length 82 [2022-07-20 04:03:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:09,836 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3014 transitions. [2022-07-20 04:03:09,836 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-20 04:03:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3014 transitions. [2022-07-20 04:03:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 04:03:09,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:09,838 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-20 04:03:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:03:09,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:03:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1455084961, now seen corresponding path program 1 times [2022-07-20 04:03:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:09,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701166095] [2022-07-20 04:03:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:03:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:03:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:03:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 04:03:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:03:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:03:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-20 04:03:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701166095] [2022-07-20 04:03:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701166095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:10,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:03:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352687860] [2022-07-20 04:03:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:10,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:03:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:03:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:03:10,069 INFO L87 Difference]: Start difference. First operand 2248 states and 3014 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:03:12,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:15,163 INFO L93 Difference]: Finished difference Result 4540 states and 6203 transitions. [2022-07-20 04:03:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2022-07-20 04:03:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:15,176 INFO L225 Difference]: With dead ends: 4540 [2022-07-20 04:03:15,176 INFO L226 Difference]: Without dead ends: 2311 [2022-07-20 04:03:15,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 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-20 04:03:15,185 INFO L413 NwaCegarLoop]: 1284 mSDtfsCounter, 3311 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 2258 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3414 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2258 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:15,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3414 Valid, 1992 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2258 Valid, 1451 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-07-20 04:03:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-20 04:03:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2255. [2022-07-20 04:03:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1540 states have (on average 1.2227272727272727) internal successors, (1883), 1597 states have internal predecessors, (1883), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3045 transitions. [2022-07-20 04:03:15,281 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3045 transitions. Word has length 93 [2022-07-20 04:03:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:15,283 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3045 transitions. [2022-07-20 04:03:15,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:03:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3045 transitions. [2022-07-20 04:03:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 04:03:15,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:15,285 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-20 04:03:15,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:03:15,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 27 more)] === [2022-07-20 04:03:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -174515702, now seen corresponding path program 1 times [2022-07-20 04:03:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926648571] [2022-07-20 04:03:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:15,443 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-20 04:03:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926648571] [2022-07-20 04:03:15,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926648571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:15,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:15,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408303118] [2022-07-20 04:03:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:15,446 INFO L87 Difference]: Start difference. First operand 2255 states and 3045 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-20 04:03:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:18,333 INFO L93 Difference]: Finished difference Result 2255 states and 3045 transitions. [2022-07-20 04:03:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:18,335 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-20 04:03:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:18,343 INFO L225 Difference]: With dead ends: 2255 [2022-07-20 04:03:18,343 INFO L226 Difference]: Without dead ends: 2253 [2022-07-20 04:03:18,343 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-20 04:03:18,344 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2638 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:18,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2241 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 04:03:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2022-07-20 04:03:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2253. [2022-07-20 04:03:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1539 states have (on average 1.2222222222222223) internal successors, (1881), 1595 states have internal predecessors, (1881), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3043 transitions. [2022-07-20 04:03:18,421 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3043 transitions. Word has length 88 [2022-07-20 04:03:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:18,422 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3043 transitions. [2022-07-20 04:03:18,422 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-20 04:03:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3043 transitions. [2022-07-20 04:03:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 04:03:18,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:18,424 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-20 04:03:18,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:03:18,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:03:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 936118704, now seen corresponding path program 1 times [2022-07-20 04:03:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:18,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815995200] [2022-07-20 04:03:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:03:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:03:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:03:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 04:03:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:03:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:03:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:03:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-20 04:03:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815995200] [2022-07-20 04:03:18,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815995200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:03:18,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439677516] [2022-07-20 04:03:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:18,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:03:18,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:03:18,658 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-20 04:03:18,659 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-20 04:03:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:03:19,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:03:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-20 04:03:19,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:03:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439677516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:19,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:03:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 04:03:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298826720] [2022-07-20 04:03:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:19,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:03:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:03:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:03:19,178 INFO L87 Difference]: Start difference. First operand 2253 states and 3043 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:03:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:19,328 INFO L93 Difference]: Finished difference Result 4481 states and 6051 transitions. [2022-07-20 04:03:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:03:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2022-07-20 04:03:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:19,340 INFO L225 Difference]: With dead ends: 4481 [2022-07-20 04:03:19,341 INFO L226 Difference]: Without dead ends: 2247 [2022-07-20 04:03:19,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:03:19,349 INFO L413 NwaCegarLoop]: 1606 mSDtfsCounter, 1586 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1606 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-20 04:03:19,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 1606 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:03:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-20 04:03:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2247. [2022-07-20 04:03:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1534 states have (on average 1.2203389830508475) internal successors, (1872), 1589 states have internal predecessors, (1872), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3034 transitions. [2022-07-20 04:03:19,434 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3034 transitions. Word has length 99 [2022-07-20 04:03:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:19,434 INFO L495 AbstractCegarLoop]: Abstraction has 2247 states and 3034 transitions. [2022-07-20 04:03:19,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:03:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3034 transitions. [2022-07-20 04:03:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 04:03:19,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:19,436 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-20 04:03:19,458 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-20 04:03:19,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:03:19,657 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 27 more)] === [2022-07-20 04:03:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 320510551, now seen corresponding path program 1 times [2022-07-20 04:03:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:19,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087814946] [2022-07-20 04:03:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:19,824 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-20 04:03:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:19,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087814946] [2022-07-20 04:03:19,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087814946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:19,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:19,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82056486] [2022-07-20 04:03:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:19,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:19,826 INFO L87 Difference]: Start difference. First operand 2247 states and 3034 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-20 04:03:21,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:23,489 INFO L93 Difference]: Finished difference Result 2247 states and 3034 transitions. [2022-07-20 04:03:23,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:23,490 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-20 04:03:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:23,499 INFO L225 Difference]: With dead ends: 2247 [2022-07-20 04:03:23,499 INFO L226 Difference]: Without dead ends: 2245 [2022-07-20 04:03:23,500 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-20 04:03:23,501 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 2627 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:23,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2721 Valid, 2220 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-20 04:03:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-07-20 04:03:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-07-20 04:03:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1533 states have (on average 1.2198303979125897) internal successors, (1870), 1587 states have internal predecessors, (1870), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3032 transitions. [2022-07-20 04:03:23,581 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3032 transitions. Word has length 94 [2022-07-20 04:03:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:23,581 INFO L495 AbstractCegarLoop]: Abstraction has 2245 states and 3032 transitions. [2022-07-20 04:03:23,581 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-20 04:03:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3032 transitions. [2022-07-20 04:03:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 04:03:23,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:23,583 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-20 04:03:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:03:23,583 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 27 more)] === [2022-07-20 04:03:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash 816605428, now seen corresponding path program 1 times [2022-07-20 04:03:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502873530] [2022-07-20 04:03:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:23,764 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-20 04:03:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:23,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502873530] [2022-07-20 04:03:23,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502873530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:23,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:23,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300449219] [2022-07-20 04:03:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:23,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:23,766 INFO L87 Difference]: Start difference. First operand 2245 states and 3032 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-20 04:03:26,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:27,907 INFO L93 Difference]: Finished difference Result 2245 states and 3032 transitions. [2022-07-20 04:03:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:27,915 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-20 04:03:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:27,942 INFO L225 Difference]: With dead ends: 2245 [2022-07-20 04:03:27,942 INFO L226 Difference]: Without dead ends: 2243 [2022-07-20 04:03:27,944 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-20 04:03:27,944 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 2621 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:27,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 2218 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1671 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:03:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-07-20 04:03:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2022-07-20 04:03:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 1532 states have (on average 1.2193211488250653) internal successors, (1868), 1585 states have internal predecessors, (1868), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3030 transitions. [2022-07-20 04:03:28,041 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3030 transitions. Word has length 100 [2022-07-20 04:03:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:28,042 INFO L495 AbstractCegarLoop]: Abstraction has 2243 states and 3030 transitions. [2022-07-20 04:03:28,043 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-20 04:03:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3030 transitions. [2022-07-20 04:03:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 04:03:28,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:28,045 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-20 04:03:28,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:03:28,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 27 more)] === [2022-07-20 04:03:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1330511425, now seen corresponding path program 1 times [2022-07-20 04:03:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:28,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371134339] [2022-07-20 04:03:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:28,267 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-20 04:03:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371134339] [2022-07-20 04:03:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371134339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:28,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:28,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529911707] [2022-07-20 04:03:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:28,269 INFO L87 Difference]: Start difference. First operand 2243 states and 3030 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-20 04:03:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:30,910 INFO L93 Difference]: Finished difference Result 2243 states and 3030 transitions. [2022-07-20 04:03:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:30,911 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-20 04:03:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:30,918 INFO L225 Difference]: With dead ends: 2243 [2022-07-20 04:03:30,919 INFO L226 Difference]: Without dead ends: 2241 [2022-07-20 04:03:30,919 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-20 04:03:30,920 INFO L413 NwaCegarLoop]: 1406 mSDtfsCounter, 2619 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:30,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 2216 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 04:03:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-07-20 04:03:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2022-07-20 04:03:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1531 states have (on average 1.2188112344872633) internal successors, (1866), 1583 states have internal predecessors, (1866), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3028 transitions. [2022-07-20 04:03:30,994 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3028 transitions. Word has length 106 [2022-07-20 04:03:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:30,995 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3028 transitions. [2022-07-20 04:03:30,995 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-20 04:03:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3028 transitions. [2022-07-20 04:03:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 04:03:30,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:30,996 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-20 04:03:30,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:03:30,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 27 more)] === [2022-07-20 04:03:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1278913922, now seen corresponding path program 1 times [2022-07-20 04:03:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:30,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706948561] [2022-07-20 04:03:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:31,119 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-20 04:03:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706948561] [2022-07-20 04:03:31,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706948561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:31,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:31,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471399942] [2022-07-20 04:03:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:31,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:31,122 INFO L87 Difference]: Start difference. First operand 2241 states and 3028 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-20 04:03:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:33,547 INFO L93 Difference]: Finished difference Result 2241 states and 3028 transitions. [2022-07-20 04:03:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:33,547 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-20 04:03:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:33,557 INFO L225 Difference]: With dead ends: 2241 [2022-07-20 04:03:33,557 INFO L226 Difference]: Without dead ends: 2239 [2022-07-20 04:03:33,568 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-20 04:03:33,568 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 2607 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:33,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 2214 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:03:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2022-07-20 04:03:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2239. [2022-07-20 04:03:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1530 states have (on average 1.2183006535947711) internal successors, (1864), 1581 states have internal predecessors, (1864), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3026 transitions. [2022-07-20 04:03:33,672 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3026 transitions. Word has length 108 [2022-07-20 04:03:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:33,673 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 3026 transitions. [2022-07-20 04:03:33,673 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-20 04:03:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3026 transitions. [2022-07-20 04:03:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 04:03:33,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:33,675 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-20 04:03:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:03:33,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 27 more)] === [2022-07-20 04:03:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1412026439, now seen corresponding path program 1 times [2022-07-20 04:03:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:33,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946566118] [2022-07-20 04:03:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:03:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,822 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-20 04:03:33,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946566118] [2022-07-20 04:03:33,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946566118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:33,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:33,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056670372] [2022-07-20 04:03:33,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:33,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:33,824 INFO L87 Difference]: Start difference. First operand 2239 states and 3026 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-20 04:03:36,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:38,191 INFO L93 Difference]: Finished difference Result 2239 states and 3026 transitions. [2022-07-20 04:03:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:38,192 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-20 04:03:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:38,200 INFO L225 Difference]: With dead ends: 2239 [2022-07-20 04:03:38,200 INFO L226 Difference]: Without dead ends: 2237 [2022-07-20 04:03:38,201 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-20 04:03:38,201 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2603 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:38,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2694 Valid, 2212 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1665 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 04:03:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2022-07-20 04:03:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2022-07-20 04:03:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1529 states have (on average 1.2177894048397646) internal successors, (1862), 1579 states have internal predecessors, (1862), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-20 04:03:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3024 transitions. [2022-07-20 04:03:38,278 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3024 transitions. Word has length 114 [2022-07-20 04:03:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:38,278 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3024 transitions. [2022-07-20 04:03:38,278 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-20 04:03:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3024 transitions. [2022-07-20 04:03:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 04:03:38,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:38,280 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 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] [2022-07-20 04:03:38,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:03:38,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 27 more)] === [2022-07-20 04:03:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1654081674, now seen corresponding path program 1 times [2022-07-20 04:03:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:38,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773132669] [2022-07-20 04:03:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 04:03:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:03:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:03:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:03:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:03:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:03:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 04:03:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-20 04:03:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:38,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773132669] [2022-07-20 04:03:38,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773132669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:38,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:38,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:03:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784259048] [2022-07-20 04:03:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:38,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:03:38,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:38,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:03:38,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:03:38,541 INFO L87 Difference]: Start difference. First operand 2237 states and 3024 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:03:41,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:43,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:45,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:50,645 INFO L93 Difference]: Finished difference Result 2499 states and 3484 transitions. [2022-07-20 04:03:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:03:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2022-07-20 04:03:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:50,660 INFO L225 Difference]: With dead ends: 2499 [2022-07-20 04:03:50,664 INFO L226 Difference]: Without dead ends: 2497 [2022-07-20 04:03:50,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-20 04:03:50,668 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 3307 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 5037 mSolverCounterSat, 2330 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 7369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2330 IncrementalHoareTripleChecker+Valid, 5037 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:50,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2956 Invalid, 7369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2330 Valid, 5037 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2022-07-20 04:03:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2022-07-20 04:03:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2370. [2022-07-20 04:03:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1616 states have (on average 1.2097772277227723) internal successors, (1955), 1667 states have internal predecessors, (1955), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:03:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3158 transitions. [2022-07-20 04:03:50,828 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3158 transitions. Word has length 139 [2022-07-20 04:03:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:50,828 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 3158 transitions. [2022-07-20 04:03:50,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:03:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3158 transitions. [2022-07-20 04:03:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:03:50,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:50,830 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-20 04:03:50,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:03:50,830 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 27 more)] === [2022-07-20 04:03:50,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash 861903971, now seen corresponding path program 1 times [2022-07-20 04:03:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:50,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430046160] [2022-07-20 04:03:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:03:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:03:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:50,995 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-20 04:03:50,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:50,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430046160] [2022-07-20 04:03:50,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430046160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:50,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:50,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429091830] [2022-07-20 04:03:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:50,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:50,997 INFO L87 Difference]: Start difference. First operand 2370 states and 3158 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-20 04:03:53,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:54,811 INFO L93 Difference]: Finished difference Result 2370 states and 3158 transitions. [2022-07-20 04:03:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:54,812 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-20 04:03:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:54,818 INFO L225 Difference]: With dead ends: 2370 [2022-07-20 04:03:54,818 INFO L226 Difference]: Without dead ends: 2368 [2022-07-20 04:03:54,820 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-20 04:03:54,820 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2591 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:54,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 2208 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-20 04:03:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-20 04:03:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-20 04:03:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1615 states have (on average 1.2092879256965945) internal successors, (1953), 1665 states have internal predecessors, (1953), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:03:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3156 transitions. [2022-07-20 04:03:54,913 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3156 transitions. Word has length 120 [2022-07-20 04:03:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:54,913 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3156 transitions. [2022-07-20 04:03:54,913 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-20 04:03:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3156 transitions. [2022-07-20 04:03:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 04:03:54,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:54,915 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-20 04:03:54,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:03:54,915 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 27 more)] === [2022-07-20 04:03:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash 805151419, now seen corresponding path program 1 times [2022-07-20 04:03:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:54,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738036513] [2022-07-20 04:03:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:03:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:03:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:03:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:55,132 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-20 04:03:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:55,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738036513] [2022-07-20 04:03:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738036513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384480393] [2022-07-20 04:03:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:55,135 INFO L87 Difference]: Start difference. First operand 2368 states and 3156 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-20 04:03:57,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:03:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:59,239 INFO L93 Difference]: Finished difference Result 2368 states and 3156 transitions. [2022-07-20 04:03:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:59,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-20 04:03:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:59,250 INFO L225 Difference]: With dead ends: 2368 [2022-07-20 04:03:59,250 INFO L226 Difference]: Without dead ends: 2366 [2022-07-20 04:03:59,253 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-20 04:03:59,254 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2585 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:59,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 2206 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1659 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:03:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2022-07-20 04:03:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2022-07-20 04:03:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1614 states have (on average 1.2087980173482031) internal successors, (1951), 1663 states have internal predecessors, (1951), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:03:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3154 transitions. [2022-07-20 04:03:59,352 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3154 transitions. Word has length 126 [2022-07-20 04:03:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:59,352 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 3154 transitions. [2022-07-20 04:03:59,352 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-20 04:03:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3154 transitions. [2022-07-20 04:03:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 04:03:59,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:59,354 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-20 04:03:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:03:59,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:03:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1795330939, now seen corresponding path program 1 times [2022-07-20 04:03:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425259039] [2022-07-20 04:03:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:03:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:03:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:03:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:03:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:03:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:03:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:03:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:03:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:03:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:03:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:03:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:03:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:03:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:59,509 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-20 04:03:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:59,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425259039] [2022-07-20 04:03:59,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425259039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:59,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:59,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562537072] [2022-07-20 04:03:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:59,511 INFO L87 Difference]: Start difference. First operand 2366 states and 3154 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-20 04:04:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:02,528 INFO L93 Difference]: Finished difference Result 2366 states and 3154 transitions. [2022-07-20 04:04:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:02,529 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-20 04:04:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:02,535 INFO L225 Difference]: With dead ends: 2366 [2022-07-20 04:04:02,535 INFO L226 Difference]: Without dead ends: 2364 [2022-07-20 04:04:02,536 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-20 04:04:02,537 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2579 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:02,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 2204 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-20 04:04:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-07-20 04:04:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2364. [2022-07-20 04:04:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 1613 states have (on average 1.208307501549907) internal successors, (1949), 1661 states have internal predecessors, (1949), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3152 transitions. [2022-07-20 04:04:02,629 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3152 transitions. Word has length 132 [2022-07-20 04:04:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 3152 transitions. [2022-07-20 04:04:02,630 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-20 04:04:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3152 transitions. [2022-07-20 04:04:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 04:04:02,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:02,632 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-20 04:04:02,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:04:02,632 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 710341783, now seen corresponding path program 1 times [2022-07-20 04:04:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:02,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138205635] [2022-07-20 04:04:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,835 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-20 04:04:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:02,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138205635] [2022-07-20 04:04:02,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138205635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:02,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:02,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291397642] [2022-07-20 04:04:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:02,838 INFO L87 Difference]: Start difference. First operand 2364 states and 3152 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-20 04:04:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:05,419 INFO L93 Difference]: Finished difference Result 2364 states and 3152 transitions. [2022-07-20 04:04:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:05,419 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-20 04:04:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:05,425 INFO L225 Difference]: With dead ends: 2364 [2022-07-20 04:04:05,425 INFO L226 Difference]: Without dead ends: 2362 [2022-07-20 04:04:05,426 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-20 04:04:05,426 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 2573 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:05,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 2202 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 04:04:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-07-20 04:04:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-07-20 04:04:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1612 states have (on average 1.2078163771712158) internal successors, (1947), 1659 states have internal predecessors, (1947), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3150 transitions. [2022-07-20 04:04:05,529 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3150 transitions. Word has length 138 [2022-07-20 04:04:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:05,530 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3150 transitions. [2022-07-20 04:04:05,530 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-20 04:04:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3150 transitions. [2022-07-20 04:04:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 04:04:05,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:05,532 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-20 04:04:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:04:05,533 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1918936592, now seen corresponding path program 1 times [2022-07-20 04:04:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:05,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259088552] [2022-07-20 04:04:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:05,756 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-20 04:04:05,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:05,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259088552] [2022-07-20 04:04:05,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259088552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:05,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:05,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480868806] [2022-07-20 04:04:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:05,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:05,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:05,759 INFO L87 Difference]: Start difference. First operand 2362 states and 3150 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-20 04:04:08,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:09,886 INFO L93 Difference]: Finished difference Result 2362 states and 3150 transitions. [2022-07-20 04:04:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:09,886 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-20 04:04:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:09,893 INFO L225 Difference]: With dead ends: 2362 [2022-07-20 04:04:09,893 INFO L226 Difference]: Without dead ends: 2360 [2022-07-20 04:04:09,895 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-20 04:04:09,895 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2567 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:09,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 2200 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1653 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:04:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-07-20 04:04:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-07-20 04:04:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1611 states have (on average 1.207324643078833) internal successors, (1945), 1657 states have internal predecessors, (1945), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3148 transitions. [2022-07-20 04:04:10,043 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3148 transitions. Word has length 144 [2022-07-20 04:04:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:10,044 INFO L495 AbstractCegarLoop]: Abstraction has 2360 states and 3148 transitions. [2022-07-20 04:04:10,044 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-20 04:04:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3148 transitions. [2022-07-20 04:04:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 04:04:10,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:10,046 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-20 04:04:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:04:10,046 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash -200822391, now seen corresponding path program 1 times [2022-07-20 04:04:10,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:10,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681102549] [2022-07-20 04:04:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:10,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-20 04:04:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:10,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681102549] [2022-07-20 04:04:10,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681102549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:10,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:10,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795630399] [2022-07-20 04:04:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:10,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:10,225 INFO L87 Difference]: Start difference. First operand 2360 states and 3148 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-20 04:04:12,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:14,436 INFO L93 Difference]: Finished difference Result 2360 states and 3148 transitions. [2022-07-20 04:04:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:14,436 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-20 04:04:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:14,443 INFO L225 Difference]: With dead ends: 2360 [2022-07-20 04:04:14,443 INFO L226 Difference]: Without dead ends: 2358 [2022-07-20 04:04:14,445 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-20 04:04:14,445 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 2561 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 2198 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:04:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2022-07-20 04:04:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2358. [2022-07-20 04:04:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1610 states have (on average 1.206832298136646) internal successors, (1943), 1655 states have internal predecessors, (1943), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3146 transitions. [2022-07-20 04:04:14,613 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3146 transitions. Word has length 150 [2022-07-20 04:04:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:14,613 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3146 transitions. [2022-07-20 04:04:14,613 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-20 04:04:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3146 transitions. [2022-07-20 04:04:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-20 04:04:14,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:14,616 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:14,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:04:14,617 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1793514094, now seen corresponding path program 1 times [2022-07-20 04:04:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:14,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765204516] [2022-07-20 04:04:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:04:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:14,805 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-20 04:04:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765204516] [2022-07-20 04:04:14,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765204516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:14,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:14,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698034266] [2022-07-20 04:04:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:14,809 INFO L87 Difference]: Start difference. First operand 2358 states and 3146 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-20 04:04:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:17,189 INFO L93 Difference]: Finished difference Result 2358 states and 3146 transitions. [2022-07-20 04:04:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:17,189 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-20 04:04:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:17,195 INFO L225 Difference]: With dead ends: 2358 [2022-07-20 04:04:17,195 INFO L226 Difference]: Without dead ends: 2356 [2022-07-20 04:04:17,196 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-20 04:04:17,197 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 2555 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:17,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 2196 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:04:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-07-20 04:04:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2022-07-20 04:04:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1609 states have (on average 1.2063393412057177) internal successors, (1941), 1653 states have internal predecessors, (1941), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3144 transitions. [2022-07-20 04:04:17,313 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3144 transitions. Word has length 156 [2022-07-20 04:04:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:17,313 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3144 transitions. [2022-07-20 04:04:17,313 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-20 04:04:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3144 transitions. [2022-07-20 04:04:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 04:04:17,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:17,316 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-20 04:04:17,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:04:17,316 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 544423176, now seen corresponding path program 1 times [2022-07-20 04:04:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:17,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850905555] [2022-07-20 04:04:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:04:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:04:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:17,519 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-20 04:04:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850905555] [2022-07-20 04:04:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850905555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:17,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:17,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527275248] [2022-07-20 04:04:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:17,522 INFO L87 Difference]: Start difference. First operand 2356 states and 3144 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-20 04:04:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:20,257 INFO L93 Difference]: Finished difference Result 2356 states and 3144 transitions. [2022-07-20 04:04:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:20,258 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-20 04:04:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:20,264 INFO L225 Difference]: With dead ends: 2356 [2022-07-20 04:04:20,264 INFO L226 Difference]: Without dead ends: 2354 [2022-07-20 04:04:20,265 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-20 04:04:20,265 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 2549 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:20,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2632 Valid, 2194 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 04:04:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2022-07-20 04:04:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2022-07-20 04:04:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 1608 states have (on average 1.2058457711442787) internal successors, (1939), 1651 states have internal predecessors, (1939), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3142 transitions. [2022-07-20 04:04:20,370 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3142 transitions. Word has length 162 [2022-07-20 04:04:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:20,371 INFO L495 AbstractCegarLoop]: Abstraction has 2354 states and 3142 transitions. [2022-07-20 04:04:20,371 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-20 04:04:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3142 transitions. [2022-07-20 04:04:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-20 04:04:20,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:20,374 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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] [2022-07-20 04:04:20,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:04:20,374 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 27 more)] === [2022-07-20 04:04:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1029405853, now seen corresponding path program 1 times [2022-07-20 04:04:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:20,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256502291] [2022-07-20 04:04:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 04:04:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:04:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:04:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:04:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:04:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:04:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 04:04:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:04:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:04:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:04:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 04:04:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:04:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:04:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:04:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-07-20 04:04:20,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:20,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256502291] [2022-07-20 04:04:20,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256502291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:20,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:20,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:04:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797174244] [2022-07-20 04:04:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:04:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:04:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:04:20,667 INFO L87 Difference]: Start difference. First operand 2354 states and 3142 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 04:04:23,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:30,680 INFO L93 Difference]: Finished difference Result 2632 states and 3755 transitions. [2022-07-20 04:04:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 04:04:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) Word has length 189 [2022-07-20 04:04:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:30,691 INFO L225 Difference]: With dead ends: 2632 [2022-07-20 04:04:30,691 INFO L226 Difference]: Without dead ends: 2630 [2022-07-20 04:04:30,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-07-20 04:04:30,694 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 3132 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 6366 mSolverCounterSat, 2702 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3132 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 9069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2702 IncrementalHoareTripleChecker+Valid, 6366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:30,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3132 Valid, 3546 Invalid, 9069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2702 Valid, 6366 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2022-07-20 04:04:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-07-20 04:04:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2352. [2022-07-20 04:04:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1607 states have (on average 1.2047293092719353) internal successors, (1936), 1649 states have internal predecessors, (1936), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3139 transitions. [2022-07-20 04:04:30,859 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3139 transitions. Word has length 189 [2022-07-20 04:04:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:30,859 INFO L495 AbstractCegarLoop]: Abstraction has 2352 states and 3139 transitions. [2022-07-20 04:04:30,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 04:04:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3139 transitions. [2022-07-20 04:04:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:04:30,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:30,862 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-20 04:04:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:04:30,862 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 308324374, now seen corresponding path program 1 times [2022-07-20 04:04:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417785055] [2022-07-20 04:04:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:30,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:04:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:04:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:04:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:31,022 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-20 04:04:31,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:31,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417785055] [2022-07-20 04:04:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417785055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:31,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:31,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78131300] [2022-07-20 04:04:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:31,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:31,025 INFO L87 Difference]: Start difference. First operand 2352 states and 3139 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-20 04:04:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:33,833 INFO L93 Difference]: Finished difference Result 2352 states and 3139 transitions. [2022-07-20 04:04:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:33,833 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-20 04:04:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:33,840 INFO L225 Difference]: With dead ends: 2352 [2022-07-20 04:04:33,840 INFO L226 Difference]: Without dead ends: 2350 [2022-07-20 04:04:33,841 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-20 04:04:33,842 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 2537 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:33,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 2190 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 04:04:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-07-20 04:04:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-07-20 04:04:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1606 states have (on average 1.2042341220423411) internal successors, (1934), 1647 states have internal predecessors, (1934), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3137 transitions. [2022-07-20 04:04:34,001 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3137 transitions. Word has length 168 [2022-07-20 04:04:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:34,002 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3137 transitions. [2022-07-20 04:04:34,002 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-20 04:04:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3137 transitions. [2022-07-20 04:04:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 04:04:34,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:34,005 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-20 04:04:34,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:04:34,006 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1078103048, now seen corresponding path program 1 times [2022-07-20 04:04:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:34,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146197571] [2022-07-20 04:04:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:04:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:04:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:04:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:04:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:34,172 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-20 04:04:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146197571] [2022-07-20 04:04:34,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146197571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:34,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:34,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128920960] [2022-07-20 04:04:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:34,174 INFO L87 Difference]: Start difference. First operand 2350 states and 3137 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-20 04:04:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:36,545 INFO L93 Difference]: Finished difference Result 2350 states and 3137 transitions. [2022-07-20 04:04:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:36,546 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-20 04:04:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:36,552 INFO L225 Difference]: With dead ends: 2350 [2022-07-20 04:04:36,552 INFO L226 Difference]: Without dead ends: 2348 [2022-07-20 04:04:36,553 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-20 04:04:36,554 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 2531 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:36,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 2188 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:04:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-07-20 04:04:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-07-20 04:04:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 1605 states have (on average 1.2037383177570093) internal successors, (1932), 1645 states have internal predecessors, (1932), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-20 04:04:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3135 transitions. [2022-07-20 04:04:36,721 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3135 transitions. Word has length 174 [2022-07-20 04:04:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:36,722 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 3135 transitions. [2022-07-20 04:04:36,722 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-20 04:04:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3135 transitions. [2022-07-20 04:04:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 04:04:36,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:36,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:36,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:04:36,725 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1433403608, now seen corresponding path program 1 times [2022-07-20 04:04:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:36,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486228149] [2022-07-20 04:04:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:04:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:04:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:04:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:04:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:04:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:04:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:04:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:04:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:04:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:04:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:04:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:04:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:04:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:04:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:04:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:04:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:36,874 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-20 04:04:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486228149] [2022-07-20 04:04:36,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486228149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:36,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:36,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130263166] [2022-07-20 04:04:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:36,876 INFO L87 Difference]: Start difference. First operand 2348 states and 3135 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-20 04:04:39,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:41,567 INFO L93 Difference]: Finished difference Result 2348 states and 3135 transitions. [2022-07-20 04:04:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:41,567 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-20 04:04:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:41,582 INFO L225 Difference]: With dead ends: 2348 [2022-07-20 04:04:41,582 INFO L226 Difference]: Without dead ends: 2192 [2022-07-20 04:04:41,586 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-20 04:04:41,586 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2522 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:41,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 2187 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1641 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-07-20 04:04:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-07-20 04:04:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2022-07-20 04:04:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 1511 states have (on average 1.213765718067505) internal successors, (1834), 1548 states have internal predecessors, (1834), 533 states have call successors, (533), 140 states have call predecessors, (533), 143 states have return successors, (588), 530 states have call predecessors, (588), 531 states have call successors, (588) [2022-07-20 04:04:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2955 transitions. [2022-07-20 04:04:41,710 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2955 transitions. Word has length 180 [2022-07-20 04:04:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:41,710 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 2955 transitions. [2022-07-20 04:04:41,710 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-20 04:04:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2955 transitions. [2022-07-20 04:04:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-20 04:04:41,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:41,714 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:41,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:04:41,714 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 27 more)] === [2022-07-20 04:04:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1420850398, now seen corresponding path program 1 times [2022-07-20 04:04:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:41,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207253794] [2022-07-20 04:04:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:04:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:04:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:04:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 04:04:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:04:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:04:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:04:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:04:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:04:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:04:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 04:04:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:04:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 04:04:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:04:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:04:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 04:04:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-20 04:04:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:42,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207253794] [2022-07-20 04:04:42,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207253794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:04:42,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105620337] [2022-07-20 04:04:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:04:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:04:42,119 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-20 04:04:42,119 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-20 04:04:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:42,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 04:04:42,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:04:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-20 04:04:42,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:04:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105620337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:42,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:04:42,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2022-07-20 04:04:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294572674] [2022-07-20 04:04:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:04:42,764 INFO L87 Difference]: Start difference. First operand 2192 states and 2955 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:04:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:43,189 INFO L93 Difference]: Finished difference Result 4383 states and 5978 transitions. [2022-07-20 04:04:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:04:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 205 [2022-07-20 04:04:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:43,200 INFO L225 Difference]: With dead ends: 4383 [2022-07-20 04:04:43,200 INFO L226 Difference]: Without dead ends: 2210 [2022-07-20 04:04:43,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:04:43,213 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 7 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7068 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:43,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7068 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:04:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-07-20 04:04:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2203. [2022-07-20 04:04:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1520 states have (on average 1.2125) internal successors, (1843), 1557 states have internal predecessors, (1843), 533 states have call successors, (533), 140 states have call predecessors, (533), 145 states have return successors, (593), 532 states have call predecessors, (593), 531 states have call successors, (593) [2022-07-20 04:04:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 2969 transitions. [2022-07-20 04:04:43,364 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 2969 transitions. Word has length 205 [2022-07-20 04:04:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:43,364 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 2969 transitions. [2022-07-20 04:04:43,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:04:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2969 transitions. [2022-07-20 04:04:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-20 04:04:43,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:43,368 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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] [2022-07-20 04:04:43,408 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-20 04:04:43,583 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-20 04:04:43,584 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:04:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1268282682, now seen corresponding path program 1 times [2022-07-20 04:04:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:43,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540682717] [2022-07-20 04:04:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:04:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:04:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:04:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:04:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:04:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:04:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 04:04:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:04:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:04:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:04:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:04:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:04:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:04:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:04:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:04:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:04:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:04:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:04:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:04:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 04:04:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 04:04:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:04:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-20 04:04:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:43,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540682717] [2022-07-20 04:04:43,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540682717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:43,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:43,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 04:04:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886980289] [2022-07-20 04:04:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:43,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:04:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:04:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:04:43,969 INFO L87 Difference]: Start difference. First operand 2203 states and 2969 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-20 04:04:47,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:51,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:53,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:04:56,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:05,562 INFO L93 Difference]: Finished difference Result 2967 states and 4184 transitions. [2022-07-20 04:05:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 04:05:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 213 [2022-07-20 04:05:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:05,570 INFO L225 Difference]: With dead ends: 2967 [2022-07-20 04:05:05,570 INFO L226 Difference]: Without dead ends: 2558 [2022-07-20 04:05:05,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-07-20 04:05:05,573 INFO L413 NwaCegarLoop]: 1243 mSDtfsCounter, 2289 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 10941 mSolverCounterSat, 1989 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 4829 SdHoareTripleChecker+Invalid, 12932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1989 IncrementalHoareTripleChecker+Valid, 10941 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 4829 Invalid, 12932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1989 Valid, 10941 Invalid, 2 Unknown, 0 Unchecked, 21.0s Time] [2022-07-20 04:05:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2022-07-20 04:05:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2223. [2022-07-20 04:05:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1534 states have (on average 1.2105606258148631) internal successors, (1857), 1571 states have internal predecessors, (1857), 535 states have call successors, (535), 140 states have call predecessors, (535), 149 states have return successors, (619), 538 states have call predecessors, (619), 533 states have call successors, (619) [2022-07-20 04:05:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3011 transitions. [2022-07-20 04:05:05,703 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3011 transitions. Word has length 213 [2022-07-20 04:05:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:05,704 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3011 transitions. [2022-07-20 04:05:05,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-20 04:05:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3011 transitions. [2022-07-20 04:05:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-20 04:05:05,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:05,708 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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] [2022-07-20 04:05:05,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:05:05,708 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-20 04:05:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1760355408, now seen corresponding path program 1 times [2022-07-20 04:05:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703866911] [2022-07-20 04:05:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:05:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:05:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:05:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:05:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:05:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 04:05:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:05:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:05:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:05:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:05:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:05:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:05:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:05:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:05:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:05:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:05:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:05:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:05:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:05:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:05:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:05:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-20 04:05:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:06,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703866911] [2022-07-20 04:05:06,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703866911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:05:06,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:05:06,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 04:05:06,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910477552] [2022-07-20 04:05:06,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:05:06,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:05:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:05:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:05:06,110 INFO L87 Difference]: Start difference. First operand 2223 states and 3011 transitions. Second operand has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-20 04:05:11,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:14,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:17,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:19,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:05:28,717 INFO L93 Difference]: Finished difference Result 3007 states and 4250 transitions. [2022-07-20 04:05:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 04:05:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) Word has length 221 [2022-07-20 04:05:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:05:28,727 INFO L225 Difference]: With dead ends: 3007 [2022-07-20 04:05:28,727 INFO L226 Difference]: Without dead ends: 2578 [2022-07-20 04:05:28,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2022-07-20 04:05:28,730 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 2116 mSDsluCounter, 3840 mSDsCounter, 0 mSdLazyCounter, 11912 mSolverCounterSat, 1693 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 5096 SdHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1693 IncrementalHoareTripleChecker+Valid, 11912 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:05:28,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 5096 Invalid, 13609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1693 Valid, 11912 Invalid, 4 Unknown, 0 Unchecked, 22.1s Time] [2022-07-20 04:05:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-07-20 04:05:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2225. [2022-07-20 04:05:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1536 states have (on average 1.2102864583333333) internal successors, (1859), 1573 states have internal predecessors, (1859), 535 states have call successors, (535), 140 states have call predecessors, (535), 149 states have return successors, (619), 538 states have call predecessors, (619), 533 states have call successors, (619) [2022-07-20 04:05:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3013 transitions. [2022-07-20 04:05:28,921 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3013 transitions. Word has length 221 [2022-07-20 04:05:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:05:28,922 INFO L495 AbstractCegarLoop]: Abstraction has 2225 states and 3013 transitions. [2022-07-20 04:05:28,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-20 04:05:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3013 transitions. [2022-07-20 04:05:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-20 04:05:28,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:05:28,926 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-20 04:05:28,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 04:05:28,926 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 27 more)] === [2022-07-20 04:05:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:05:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1284645112, now seen corresponding path program 1 times [2022-07-20 04:05:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:05:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660763759] [2022-07-20 04:05:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:05:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:05:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:05:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:05:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:05:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:05:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:05:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:05:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:05:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 04:05:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:05:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:05:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:05:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:05:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:05:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:05:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:05:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:05:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:05:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 04:05:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:05:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:05:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:05:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:05:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 04:05:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:05:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-07-20 04:05:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:05:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660763759] [2022-07-20 04:05:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660763759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:05:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326706461] [2022-07-20 04:05:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:05:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:05:29,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:05:29,268 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-20 04:05:29,271 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-20 04:05:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:05:29,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:05:29,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:05:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 99 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-20 04:05:30,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:05:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-07-20 04:05:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326706461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:05:30,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:05:30,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-07-20 04:05:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899070232] [2022-07-20 04:05:30,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:05:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 04:05:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:05:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 04:05:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:05:30,474 INFO L87 Difference]: Start difference. First operand 2225 states and 3013 transitions. Second operand has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-07-20 04:05:35,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:37,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:40,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:43,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:45,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:48,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:50,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:51,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:05:53,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:06,904 INFO L93 Difference]: Finished difference Result 4546 states and 6311 transitions. [2022-07-20 04:06:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 04:06:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) Word has length 221 [2022-07-20 04:06:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:06,911 INFO L225 Difference]: With dead ends: 4546 [2022-07-20 04:06:06,911 INFO L226 Difference]: Without dead ends: 2338 [2022-07-20 04:06:06,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 04:06:06,925 INFO L413 NwaCegarLoop]: 1294 mSDtfsCounter, 1776 mSDsluCounter, 5237 mSDsCounter, 0 mSdLazyCounter, 16844 mSolverCounterSat, 1305 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 18155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1305 IncrementalHoareTripleChecker+Valid, 16844 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:06,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 6531 Invalid, 18155 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1305 Valid, 16844 Invalid, 6 Unknown, 0 Unchecked, 35.8s Time] [2022-07-20 04:06:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2022-07-20 04:06:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2236. [2022-07-20 04:06:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 1544 states have (on average 1.2085492227979275) internal successors, (1866), 1579 states have internal predecessors, (1866), 536 states have call successors, (536), 140 states have call predecessors, (536), 151 states have return successors, (624), 543 states have call predecessors, (624), 534 states have call successors, (624) [2022-07-20 04:06:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3026 transitions. [2022-07-20 04:06:07,153 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3026 transitions. Word has length 221 [2022-07-20 04:06:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:07,153 INFO L495 AbstractCegarLoop]: Abstraction has 2236 states and 3026 transitions. [2022-07-20 04:06:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-07-20 04:06:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3026 transitions. [2022-07-20 04:06:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-20 04:06:07,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:07,158 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 9, 9, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:06:07,182 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-20 04:06:07,371 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-20 04:06:07,371 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 27 more)] === [2022-07-20 04:06:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1754433813, now seen corresponding path program 1 times [2022-07-20 04:06:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173001233] [2022-07-20 04:06:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:06:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:06:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:06:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:06:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:06:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:06:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:06:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:06:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 04:06:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:06:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:06:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:06:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-20 04:06:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:06:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:06:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 04:06:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-20 04:06:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:06:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:06:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-20 04:06:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-20 04:06:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-20 04:06:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-20 04:06:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-07-20 04:06:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-07-20 04:06:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-07-20 04:06:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173001233] [2022-07-20 04:06:08,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173001233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:06:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141787437] [2022-07-20 04:06:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:08,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:06:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:06:08,024 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-20 04:06:08,025 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-20 04:06:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:08,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 2961 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 04:06:08,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:06:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2022-07-20 04:06:08,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:06:08,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141787437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:06:08,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:06:08,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 28 [2022-07-20 04:06:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494003212] [2022-07-20 04:06:08,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:06:08,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:06:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:06:08,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2022-07-20 04:06:08,991 INFO L87 Difference]: Start difference. First operand 2236 states and 3026 transitions. Second operand has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-20 04:06:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:06:09,707 INFO L93 Difference]: Finished difference Result 4564 states and 6192 transitions. [2022-07-20 04:06:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 04:06:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) Word has length 342 [2022-07-20 04:06:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:06:09,715 INFO L225 Difference]: With dead ends: 4564 [2022-07-20 04:06:09,716 INFO L226 Difference]: Without dead ends: 2460 [2022-07-20 04:06:09,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 04:06:09,727 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 438 mSDsluCounter, 18979 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 20488 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:06:09,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 20488 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:06:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2022-07-20 04:06:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2268. [2022-07-20 04:06:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 1567 states have (on average 1.2054881940012763) internal successors, (1889), 1601 states have internal predecessors, (1889), 544 states have call successors, (544), 140 states have call predecessors, (544), 152 states have return successors, (634), 553 states have call predecessors, (634), 542 states have call successors, (634) [2022-07-20 04:06:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3067 transitions. [2022-07-20 04:06:09,875 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3067 transitions. Word has length 342 [2022-07-20 04:06:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:06:09,875 INFO L495 AbstractCegarLoop]: Abstraction has 2268 states and 3067 transitions. [2022-07-20 04:06:09,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-20 04:06:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3067 transitions. [2022-07-20 04:06:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-20 04:06:09,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:06:09,879 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:06:09,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 04:06:10,095 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-20 04:06:10,095 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 27 more)] === [2022-07-20 04:06:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:06:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1038366459, now seen corresponding path program 1 times [2022-07-20 04:06:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:06:10,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970252466] [2022-07-20 04:06:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:06:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:06:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:06:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:06:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:06:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:06:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:06:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:06:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:06:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:06:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:06:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:06:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:06:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:06:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:06:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:06:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 04:06:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:06:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 04:06:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:06:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:06:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:06:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:06:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:06:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:06:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:06:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:06:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2022-07-20 04:06:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:06:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970252466] [2022-07-20 04:06:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970252466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:06:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234470111] [2022-07-20 04:06:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:06:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:06:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:06:10,532 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-20 04:06:10,533 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-20 04:06:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:06:11,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 04:06:11,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:06:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2022-07-20 04:06:11,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:06:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-07-20 04:06:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234470111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:06:12,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:06:12,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 30 [2022-07-20 04:06:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582812980] [2022-07-20 04:06:12,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:06:12,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 04:06:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:06:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 04:06:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2022-07-20 04:06:12,049 INFO L87 Difference]: Start difference. First operand 2268 states and 3067 transitions. Second operand has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 19 states have internal predecessors, (129), 5 states have call successors, (47), 7 states have call predecessors, (47), 8 states have return successors, (41), 10 states have call predecessors, (41), 5 states have call successors, (41) [2022-07-20 04:06:18,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:20,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:22,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:24,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:27,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:29,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:31,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:32,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:35,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:37,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:39,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:53,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:06:59,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []