./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.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 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:54:45,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:54:45,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:54:45,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:54:45,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:54:45,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:54:45,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:54:45,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:54:45,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:54:45,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:54:45,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:54:45,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:54:45,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:54:45,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:54:45,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:54:45,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:54:45,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:54:45,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:54:45,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:54:45,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:54:45,807 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:54:45,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:54:45,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:54:45,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:54:45,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:54:45,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:54:45,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:54:45,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:54:45,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:54:45,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:54:45,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:54:45,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:54:45,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:54:45,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:54:45,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:54:45,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:54:45,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:54:45,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:54:45,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:54:45,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:54:45,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:54:45,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:54:45,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:54:45,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:54:45,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:54:45,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:54:45,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:54:45,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:54:45,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:54:45,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:54:45,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:54:45,856 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:54:45,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:54:45,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:54:45,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:54:45,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:54:45,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:54:45,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:54:45,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:54:45,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:54:45,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:54:45,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:54:45,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:54:45,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:54:45,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:54:45,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:54:45,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:54:45,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:54:45,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:54:45,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:54:45,861 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:54:45,861 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:54:45,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:54:45,862 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 -> 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 [2022-07-14 04:54:46,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:54:46,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:54:46,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:54:46,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:54:46,094 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:54:46,095 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---kernel--locking--locktorture.ko.cil.i [2022-07-14 04:54:46,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2725f587f/40bd40ff36d04d29abe9936c06e22c24/FLAG4ce47f3d8 [2022-07-14 04:54:46,692 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:54:46,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-14 04:54:46,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2725f587f/40bd40ff36d04d29abe9936c06e22c24/FLAG4ce47f3d8 [2022-07-14 04:54:47,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2725f587f/40bd40ff36d04d29abe9936c06e22c24 [2022-07-14 04:54:47,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:54:47,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:54:47,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:54:47,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:54:47,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:54:47,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:54:47" (1/1) ... [2022-07-14 04:54:47,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2054a98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:47, skipping insertion in model container [2022-07-14 04:54:47,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:54:47" (1/1) ... [2022-07-14 04:54:47,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:54:47,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:54:48,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-14 04:54:48,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-14 04:54:48,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-14 04:54:48,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-14 04:54:48,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-14 04:54:48,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-14 04:54:48,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-14 04:54:48,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-14 04:54:48,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-14 04:54:48,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-14 04:54:48,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-14 04:54:48,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-14 04:54:48,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-14 04:54:48,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-14 04:54:48,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-14 04:54:48,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-14 04:54:48,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-14 04:54:48,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-14 04:54:48,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-14 04:54:48,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-14 04:54:48,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-14 04:54:48,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-14 04:54:48,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-14 04:54:48,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-14 04:54:48,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-14 04:54:48,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-14 04:54:48,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-14 04:54:48,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-14 04:54:48,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-14 04:54:48,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-14 04:54:48,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-14 04:54:48,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-14 04:54:48,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-14 04:54:48,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-14 04:54:48,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-14 04:54:48,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-14 04:54:48,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-14 04:54:48,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-14 04:54:48,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-14 04:54:48,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-14 04:54:48,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-14 04:54:48,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-14 04:54:48,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-14 04:54:48,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-14 04:54:48,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-14 04:54:48,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-14 04:54:48,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-14 04:54:48,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-14 04:54:48,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-14 04:54:48,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-14 04:54:48,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-14 04:54:48,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-14 04:54:48,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-14 04:54:48,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-14 04:54:48,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-14 04:54:48,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-14 04:54:48,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-14 04:54:48,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-14 04:54:48,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-14 04:54:48,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-14 04:54:48,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-14 04:54:48,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-14 04:54:48,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-14 04:54:48,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-14 04:54:48,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-14 04:54:48,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-14 04:54:48,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-14 04:54:48,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-14 04:54:48,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-14 04:54:48,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-14 04:54:48,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-14 04:54:48,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-14 04:54:48,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-14 04:54:48,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-14 04:54:48,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-14 04:54:48,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-14 04:54:48,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-14 04:54:48,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-14 04:54:48,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-14 04:54:48,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-14 04:54:48,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-14 04:54:48,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-14 04:54:48,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-14 04:54:48,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-14 04:54:48,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-14 04:54:48,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-14 04:54:48,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-14 04:54:48,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-14 04:54:48,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:54:48,609 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:54:48,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-14 04:54:48,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-14 04:54:48,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-14 04:54:48,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-14 04:54:48,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-14 04:54:48,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-14 04:54:48,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-14 04:54:48,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-14 04:54:48,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-14 04:54:48,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-14 04:54:48,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-14 04:54:48,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-14 04:54:48,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-14 04:54:48,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-14 04:54:48,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-14 04:54:48,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-14 04:54:48,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-14 04:54:48,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-14 04:54:48,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-14 04:54:48,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-14 04:54:48,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-14 04:54:48,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-14 04:54:48,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-14 04:54:48,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-14 04:54:48,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-14 04:54:48,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-14 04:54:48,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-14 04:54:48,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-14 04:54:48,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-14 04:54:48,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-14 04:54:48,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-14 04:54:48,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-14 04:54:48,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-14 04:54:48,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-14 04:54:48,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-14 04:54:48,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-14 04:54:48,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-14 04:54:48,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-14 04:54:48,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-14 04:54:48,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-14 04:54:48,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-14 04:54:48,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-14 04:54:48,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-14 04:54:48,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-14 04:54:48,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-14 04:54:48,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-14 04:54:48,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-14 04:54:48,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-14 04:54:48,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-14 04:54:48,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-14 04:54:48,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-14 04:54:48,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-14 04:54:48,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-14 04:54:48,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-14 04:54:48,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-14 04:54:48,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-14 04:54:48,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-14 04:54:48,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-14 04:54:48,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-14 04:54:48,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-14 04:54:48,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-14 04:54:48,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-14 04:54:48,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-14 04:54:48,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-14 04:54:48,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-14 04:54:48,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-14 04:54:48,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-14 04:54:48,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-14 04:54:48,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-14 04:54:48,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-14 04:54:48,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-14 04:54:48,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-14 04:54:48,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-14 04:54:48,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-14 04:54:48,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-14 04:54:48,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-14 04:54:48,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-14 04:54:48,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-14 04:54:48,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-14 04:54:48,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-14 04:54:48,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-14 04:54:48,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-14 04:54:48,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-14 04:54:48,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-14 04:54:48,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-14 04:54:48,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-14 04:54:48,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-14 04:54:48,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-14 04:54:48,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:54:48,929 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:54:48,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48 WrapperNode [2022-07-14 04:54:48,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:54:48,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:54:48,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:54:48,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:54:48,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,103 INFO L137 Inliner]: procedures = 486, calls = 1092, calls flagged for inlining = 196, calls inlined = 121, statements flattened = 1951 [2022-07-14 04:54:49,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:54:49,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:54:49,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:54:49,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:54:49,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:54:49,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:54:49,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:54:49,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:54:49,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (1/1) ... [2022-07-14 04:54:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:54:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:54:49,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 04:54:49,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 04:54:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-14 04:54:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:54:49,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:54:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:54:49,293 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:54:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-07-14 04:54:49,294 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-07-14 04:54:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:54:49,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:54:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-07-14 04:54:49,294 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-07-14 04:54:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_lock [2022-07-14 04:54:49,294 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_lock [2022-07-14 04:54:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:54:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:54:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-07-14 04:54:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-07-14 04:54:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:54:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:54:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-07-14 04:54:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-07-14 04:54:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:54:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:54:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-07-14 04:54:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-07-14 04:54:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:54:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:54:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_delay [2022-07-14 04:54:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_delay [2022-07-14 04:54:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_delay [2022-07-14 04:54:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_delay [2022-07-14 04:54:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:54:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:54:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:54:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:54:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:54:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:54:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-07-14 04:54:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-07-14 04:54:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:54:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-14 04:54:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-14 04:54:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 04:54:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 04:54:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:54:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:54:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_lock_irq [2022-07-14 04:54:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_lock_irq [2022-07-14 04:54:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-07-14 04:54:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-07-14 04:54:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:54:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:54:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:54:49,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:54:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:54:49,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:54:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:54:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:54:49,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:54:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:54:49,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:54:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:54:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:54:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-14 04:54:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-14 04:54:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:54:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:54:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_write [2022-07-14 04:54:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_write [2022-07-14 04:54:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:54:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:54:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2022-07-14 04:54:49,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2022-07-14 04:54:49,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:54:49,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:54:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-14 04:54:49,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-14 04:54:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:54:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_read [2022-07-14 04:54:49,306 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_read [2022-07-14 04:54:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-07-14 04:54:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-07-14 04:54:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_unlock [2022-07-14 04:54:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_unlock [2022-07-14 04:54:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_write [2022-07-14 04:54:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_write [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:54:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_unlock_irq [2022-07-14 04:54:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_unlock_irq [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:54:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:54:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-07-14 04:54:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-07-14 04:54:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:54:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:54:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_read [2022-07-14 04:54:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_read [2022-07-14 04:54:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_write_delay [2022-07-14 04:54:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_write_delay [2022-07-14 04:54:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-07-14 04:54:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-07-14 04:54:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:54:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:54:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:54:49,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:54:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:54:49,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:54:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-07-14 04:54:49,310 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-07-14 04:54:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-14 04:54:49,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-14 04:54:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock_irq [2022-07-14 04:54:49,310 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock_irq [2022-07-14 04:54:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:54:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:54:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:54:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:54:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:54:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:54:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-14 04:54:49,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:54:49,312 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:54:49,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:54:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-07-14 04:54:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-07-14 04:54:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock_irq [2022-07-14 04:54:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock_irq [2022-07-14 04:54:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:54:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:54:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:54:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:54:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_read_delay [2022-07-14 04:54:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_read_delay [2022-07-14 04:54:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:54:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2022-07-14 04:54:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:54:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_delay [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_delay [2022-07-14 04:54:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:54:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:54:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:54:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:54:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:54:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-07-14 04:54:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-07-14 04:54:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:54:49,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:54:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure __torture_print_stats [2022-07-14 04:54:49,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __torture_print_stats [2022-07-14 04:54:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-14 04:54:49,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-14 04:54:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:54:49,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:54:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock [2022-07-14 04:54:49,316 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock [2022-07-14 04:54:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock [2022-07-14 04:54:49,317 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock [2022-07-14 04:54:49,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:54:49,706 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:54:49,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:54:49,849 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:54:50,680 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:54:50,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:54:50,698 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:54:50,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:54:50 BoogieIcfgContainer [2022-07-14 04:54:50,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:54:50,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:54:50,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:54:50,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:54:50,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:54:47" (1/3) ... [2022-07-14 04:54:50,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d732172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:54:50, skipping insertion in model container [2022-07-14 04:54:50,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:48" (2/3) ... [2022-07-14 04:54:50,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d732172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:54:50, skipping insertion in model container [2022-07-14 04:54:50,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:54:50" (3/3) ... [2022-07-14 04:54:50,708 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-14 04:54:50,718 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:54:50,718 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-14 04:54:50,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:54:50,764 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@74ee3734, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4177e95e [2022-07-14 04:54:50,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-14 04:54:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) [2022-07-14 04:54:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 04:54:50,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:50,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:54:50,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:54:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash -192389351, now seen corresponding path program 1 times [2022-07-14 04:54:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:50,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472243710] [2022-07-14 04:54:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:54:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:51,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472243710] [2022-07-14 04:54:51,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472243710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:51,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:51,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 04:54:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759668764] [2022-07-14 04:54:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:54:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:54:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:54:51,121 INFO L87 Difference]: Start difference. First operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:54:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:54:51,336 INFO L93 Difference]: Finished difference Result 2259 states and 3174 transitions. [2022-07-14 04:54:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:54:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-14 04:54:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:51,362 INFO L225 Difference]: With dead ends: 2259 [2022-07-14 04:54:51,362 INFO L226 Difference]: Without dead ends: 1290 [2022-07-14 04:54:51,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:54:51,382 INFO L413 NwaCegarLoop]: 1628 mSDtfsCounter, 314 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:51,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2914 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 04:54:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-07-14 04:54:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 945. [2022-07-14 04:54:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 642 states have (on average 1.2523364485981308) internal successors, (804), 695 states have internal predecessors, (804), 193 states have call successors, (193), 80 states have call predecessors, (193), 79 states have return successors, (191), 183 states have call predecessors, (191), 191 states have call successors, (191) [2022-07-14 04:54:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1188 transitions. [2022-07-14 04:54:51,495 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1188 transitions. Word has length 26 [2022-07-14 04:54:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:51,495 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1188 transitions. [2022-07-14 04:54:51,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:54:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1188 transitions. [2022-07-14 04:54:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 04:54:51,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:51,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:54:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:54:51,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:54:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789480, now seen corresponding path program 1 times [2022-07-14 04:54:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002931666] [2022-07-14 04:54:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:54:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002931666] [2022-07-14 04:54:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002931666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:54:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855524216] [2022-07-14 04:54:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:54:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:54:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:54:51,945 INFO L87 Difference]: Start difference. First operand 945 states and 1188 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:54:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:54:53,844 INFO L93 Difference]: Finished difference Result 2964 states and 3704 transitions. [2022-07-14 04:54:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:54:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-14 04:54:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:53,853 INFO L225 Difference]: With dead ends: 2964 [2022-07-14 04:54:53,854 INFO L226 Difference]: Without dead ends: 2053 [2022-07-14 04:54:53,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:54:53,857 INFO L413 NwaCegarLoop]: 1736 mSDtfsCounter, 1437 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 10022 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:53,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 10022 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 04:54:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-07-14 04:54:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1793. [2022-07-14 04:54:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1244 states have (on average 1.2532154340836013) internal successors, (1559), 1317 states have internal predecessors, (1559), 355 states have call successors, (355), 165 states have call predecessors, (355), 163 states have return successors, (362), 337 states have call predecessors, (362), 353 states have call successors, (362) [2022-07-14 04:54:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2276 transitions. [2022-07-14 04:54:53,924 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2276 transitions. Word has length 28 [2022-07-14 04:54:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:53,924 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2276 transitions. [2022-07-14 04:54:53,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:54:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2276 transitions. [2022-07-14 04:54:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 04:54:53,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:53,926 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:54:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:54:53,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:54:53,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1675116871, now seen corresponding path program 1 times [2022-07-14 04:54:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:53,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318157167] [2022-07-14 04:54:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:54:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318157167] [2022-07-14 04:54:54,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318157167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:54:54,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458559111] [2022-07-14 04:54:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:54,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:54:54,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:54:54,327 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-14 04:54:54,328 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-14 04:54:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:54,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 04:54:54,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:54:54,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,907 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 04:54:54,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-14 04:54:54,922 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:54:54,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:54:54,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:54:54,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:54:55,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:54:55,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:54:55,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:54:55,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:54:55,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 04:54:55,265 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:54:55,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-14 04:54:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:54:55,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:54:59,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:54:59,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:54:59,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:54:59,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:54:59,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:54:59,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:54:59,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:54:59,993 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:54:59,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:00,104 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:00,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:00,188 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:00,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:00,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458559111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:00,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:00,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2022-07-14 04:55:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446155957] [2022-07-14 04:55:00,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:00,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 04:55:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 04:55:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=410, Unknown=9, NotChecked=126, Total=600 [2022-07-14 04:55:00,210 INFO L87 Difference]: Start difference. First operand 1793 states and 2276 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:03,731 INFO L93 Difference]: Finished difference Result 4142 states and 5271 transitions. [2022-07-14 04:55:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:55:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-14 04:55:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:03,742 INFO L225 Difference]: With dead ends: 4142 [2022-07-14 04:55:03,742 INFO L226 Difference]: Without dead ends: 2384 [2022-07-14 04:55:03,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=129, Invalid=804, Unknown=9, NotChecked=180, Total=1122 [2022-07-14 04:55:03,748 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 1992 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:03,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 17561 Invalid, 5504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 4020 Invalid, 0 Unknown, 529 Unchecked, 2.9s Time] [2022-07-14 04:55:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-07-14 04:55:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2044. [2022-07-14 04:55:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1439 states have (on average 1.266851980542043) internal successors, (1823), 1513 states have internal predecessors, (1823), 395 states have call successors, (395), 181 states have call predecessors, (395), 179 states have return successors, (402), 375 states have call predecessors, (402), 393 states have call successors, (402) [2022-07-14 04:55:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2620 transitions. [2022-07-14 04:55:03,819 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2620 transitions. Word has length 31 [2022-07-14 04:55:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:03,819 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2620 transitions. [2022-07-14 04:55:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2620 transitions. [2022-07-14 04:55:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 04:55:03,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:03,821 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:55:03,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 04:55:04,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:04,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 356279481, now seen corresponding path program 1 times [2022-07-14 04:55:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077483091] [2022-07-14 04:55:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:04,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077483091] [2022-07-14 04:55:04,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077483091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:04,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836033980] [2022-07-14 04:55:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:04,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:55:04,184 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-14 04:55:04,213 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-14 04:55:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 04:55:04,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:55:04,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:55:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:04,738 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 04:55:04,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-14 04:55:04,754 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:55:04,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:04,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:04,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:04,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:55:04,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:55:04,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-07-14 04:55:04,985 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:55:04,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-14 04:55:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:05,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:55:12,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:12,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:12,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:55:12,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:55:12,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:55:12,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:55:12,284 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:12,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:12,376 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:12,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:12,434 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:12,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836033980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:12,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2022-07-14 04:55:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521357291] [2022-07-14 04:55:12,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:12,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:55:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:55:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=253, Unknown=10, NotChecked=66, Total=380 [2022-07-14 04:55:12,455 INFO L87 Difference]: Start difference. First operand 2044 states and 2620 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:18,835 INFO L93 Difference]: Finished difference Result 6736 states and 9287 transitions. [2022-07-14 04:55:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:55:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-14 04:55:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:18,856 INFO L225 Difference]: With dead ends: 6736 [2022-07-14 04:55:18,857 INFO L226 Difference]: Without dead ends: 5516 [2022-07-14 04:55:18,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=174, Invalid=694, Unknown=10, NotChecked=114, Total=992 [2022-07-14 04:55:18,862 INFO L413 NwaCegarLoop]: 3133 mSDtfsCounter, 3152 mSDsluCounter, 22071 mSDsCounter, 0 mSdLazyCounter, 6685 mSolverCounterSat, 838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 25204 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 6685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:18,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3473 Valid, 25204 Invalid, 8569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [838 Valid, 6685 Invalid, 0 Unknown, 1046 Unchecked, 5.5s Time] [2022-07-14 04:55:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2022-07-14 04:55:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 2122. [2022-07-14 04:55:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1506 states have (on average 1.2755644090305445) internal successors, (1921), 1581 states have internal predecessors, (1921), 406 states have call successors, (406), 181 states have call predecessors, (406), 179 states have return successors, (413), 385 states have call predecessors, (413), 404 states have call successors, (413) [2022-07-14 04:55:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2740 transitions. [2022-07-14 04:55:18,975 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2740 transitions. Word has length 32 [2022-07-14 04:55:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:18,975 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 2740 transitions. [2022-07-14 04:55:18,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2740 transitions. [2022-07-14 04:55:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 04:55:18,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:18,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-14 04:55:19,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-14 04:55:19,197 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,SelfDestructingSolverStorable3 [2022-07-14 04:55:19,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1407947960, now seen corresponding path program 2 times [2022-07-14 04:55:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889600181] [2022-07-14 04:55:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:19,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889600181] [2022-07-14 04:55:19,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889600181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:19,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823215960] [2022-07-14 04:55:19,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 04:55:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:55:19,536 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-14 04:55:19,537 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-14 04:55:19,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 04:55:19,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:55:19,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 04:55:19,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:55:20,091 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:55:20,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:20,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:55:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:20,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:55:20,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:20,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:20,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:20,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:20,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:55:20,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:55:20,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 04:55:20,475 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:55:20,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-14 04:55:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:20,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:55:26,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:26,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:26,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:26,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:55:26,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:55:26,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:55:26,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:55:26,753 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:26,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:26,843 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:26,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:26,896 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:26,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:26,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823215960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:26,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:26,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-14 04:55:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403911494] [2022-07-14 04:55:26,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:26,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 04:55:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 04:55:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=434, Unknown=11, NotChecked=132, Total=650 [2022-07-14 04:55:26,922 INFO L87 Difference]: Start difference. First operand 2122 states and 2740 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:30,750 INFO L93 Difference]: Finished difference Result 4527 states and 5850 transitions. [2022-07-14 04:55:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:55:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-07-14 04:55:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:30,760 INFO L225 Difference]: With dead ends: 4527 [2022-07-14 04:55:30,760 INFO L226 Difference]: Without dead ends: 3326 [2022-07-14 04:55:30,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=143, Invalid=728, Unknown=11, NotChecked=174, Total=1056 [2022-07-14 04:55:30,763 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 2154 mSDsluCounter, 17206 mSDsCounter, 0 mSdLazyCounter, 4260 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 18699 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 4260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:30,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 18699 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 4260 Invalid, 0 Unknown, 551 Unchecked, 3.2s Time] [2022-07-14 04:55:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-07-14 04:55:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2416. [2022-07-14 04:55:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1732 states have (on average 1.2869515011547343) internal successors, (2229), 1810 states have internal predecessors, (2229), 455 states have call successors, (455), 200 states have call predecessors, (455), 198 states have return successors, (464), 431 states have call predecessors, (464), 453 states have call successors, (464) [2022-07-14 04:55:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3148 transitions. [2022-07-14 04:55:30,863 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3148 transitions. Word has length 34 [2022-07-14 04:55:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:30,863 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 3148 transitions. [2022-07-14 04:55:30,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3148 transitions. [2022-07-14 04:55:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 04:55:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:30,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:30,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 04:55:31,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:31,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash 663977832, now seen corresponding path program 2 times [2022-07-14 04:55:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:31,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747306068] [2022-07-14 04:55:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747306068] [2022-07-14 04:55:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747306068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120622341] [2022-07-14 04:55:31,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 04:55:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:55:31,210 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-14 04:55:31,211 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-14 04:55:31,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 04:55:31,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:55:31,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 04:55:31,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:55:31,762 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:55:31,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:31,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:55:31,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:31,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:55:31,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:31,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:31,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:31,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:32,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:55:32,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:55:32,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-14 04:55:32,144 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:55:32,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-14 04:55:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:32,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:55:38,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:55:38,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:38,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:38,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:38,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:55:38,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:55:38,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:55:38,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:55:38,484 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:38,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:38,570 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:38,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:38,622 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:38,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:38,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120622341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:38,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:38,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2022-07-14 04:55:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394069530] [2022-07-14 04:55:38,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 04:55:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 04:55:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=289, Unknown=9, NotChecked=148, Total=506 [2022-07-14 04:55:38,641 INFO L87 Difference]: Start difference. First operand 2416 states and 3148 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:43,833 INFO L93 Difference]: Finished difference Result 8549 states and 11926 transitions. [2022-07-14 04:55:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 04:55:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-07-14 04:55:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:43,861 INFO L225 Difference]: With dead ends: 8549 [2022-07-14 04:55:43,861 INFO L226 Difference]: Without dead ends: 6764 [2022-07-14 04:55:43,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=158, Invalid=719, Unknown=9, NotChecked=236, Total=1122 [2022-07-14 04:55:43,867 INFO L413 NwaCegarLoop]: 4072 mSDtfsCounter, 4008 mSDsluCounter, 22759 mSDsCounter, 0 mSdLazyCounter, 5855 mSolverCounterSat, 1453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 26831 SdHoareTripleChecker+Invalid, 8834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1453 IncrementalHoareTripleChecker+Valid, 5855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1526 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:43,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 26831 Invalid, 8834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1453 Valid, 5855 Invalid, 0 Unknown, 1526 Unchecked, 4.2s Time] [2022-07-14 04:55:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2022-07-14 04:55:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 2426. [2022-07-14 04:55:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1740 states have (on average 1.2862068965517242) internal successors, (2238), 1819 states have internal predecessors, (2238), 456 states have call successors, (456), 201 states have call predecessors, (456), 199 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2022-07-14 04:55:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3159 transitions. [2022-07-14 04:55:44,049 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3159 transitions. Word has length 35 [2022-07-14 04:55:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:44,049 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 3159 transitions. [2022-07-14 04:55:44,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3159 transitions. [2022-07-14 04:55:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 04:55:44,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:44,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:44,071 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-14 04:55:44,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:44,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1168508767, now seen corresponding path program 1 times [2022-07-14 04:55:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:44,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985264100] [2022-07-14 04:55:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 04:55:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:44,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985264100] [2022-07-14 04:55:44,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985264100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:44,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:44,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 04:55:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345806208] [2022-07-14 04:55:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:44,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:55:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:55:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:55:44,390 INFO L87 Difference]: Start difference. First operand 2426 states and 3159 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:44,496 INFO L93 Difference]: Finished difference Result 4644 states and 6062 transitions. [2022-07-14 04:55:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:55:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-07-14 04:55:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:44,506 INFO L225 Difference]: With dead ends: 4644 [2022-07-14 04:55:44,506 INFO L226 Difference]: Without dead ends: 2426 [2022-07-14 04:55:44,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:55:44,512 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 1167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:44,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:55:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2022-07-14 04:55:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2426. [2022-07-14 04:55:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1740 states have (on average 1.2775862068965518) internal successors, (2223), 1819 states have internal predecessors, (2223), 456 states have call successors, (456), 201 states have call predecessors, (456), 199 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2022-07-14 04:55:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3144 transitions. [2022-07-14 04:55:44,653 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3144 transitions. Word has length 36 [2022-07-14 04:55:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:44,654 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 3144 transitions. [2022-07-14 04:55:44,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3144 transitions. [2022-07-14 04:55:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 04:55:44,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:44,656 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:44,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:55:44,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash 753319847, now seen corresponding path program 3 times [2022-07-14 04:55:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132984720] [2022-07-14 04:55:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132984720] [2022-07-14 04:55:45,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132984720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:45,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986947944] [2022-07-14 04:55:45,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 04:55:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:55:45,067 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-14 04:55:45,107 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-14 04:55:45,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 04:55:45,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:55:45,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 04:55:45,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:55:45,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,810 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 04:55:45,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-14 04:55:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:45,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:55:45,844 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:55:45,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:45,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:45,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:46,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:46,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:46,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:46,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:55:46,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:55:46,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:55:46,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 04:55:46,255 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:55:46,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-14 04:55:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:46,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:55:49,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:55:49,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:49,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:49,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:49,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:55:49,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:55:49,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:55:49,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:55:49,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:55:49,882 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:49,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:50,021 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:50,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:50,067 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:50,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:50,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986947944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:50,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:50,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-14 04:55:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433775581] [2022-07-14 04:55:50,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:50,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 04:55:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 04:55:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=447, Unknown=9, NotChecked=230, Total=756 [2022-07-14 04:55:50,085 INFO L87 Difference]: Start difference. First operand 2426 states and 3144 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:55,505 INFO L93 Difference]: Finished difference Result 4972 states and 6491 transitions. [2022-07-14 04:55:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:55:55,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-14 04:55:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:55,532 INFO L225 Difference]: With dead ends: 4972 [2022-07-14 04:55:55,533 INFO L226 Difference]: Without dead ends: 3771 [2022-07-14 04:55:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=151, Invalid=790, Unknown=9, NotChecked=310, Total=1260 [2022-07-14 04:55:55,536 INFO L413 NwaCegarLoop]: 1544 mSDtfsCounter, 2323 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 6540 mSolverCounterSat, 1121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 18046 SdHoareTripleChecker+Invalid, 7687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1121 IncrementalHoareTripleChecker+Valid, 6540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:55,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 18046 Invalid, 7687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1121 Valid, 6540 Invalid, 0 Unknown, 26 Unchecked, 4.6s Time] [2022-07-14 04:55:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2022-07-14 04:55:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 2721. [2022-07-14 04:55:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2721 states, 1968 states have (on average 1.2860772357723578) internal successors, (2531), 2049 states have internal predecessors, (2531), 504 states have call successors, (504), 220 states have call predecessors, (504), 218 states have return successors, (515), 477 states have call predecessors, (515), 502 states have call successors, (515) [2022-07-14 04:55:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3550 transitions. [2022-07-14 04:55:55,714 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3550 transitions. Word has length 37 [2022-07-14 04:55:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:55,715 INFO L495 AbstractCegarLoop]: Abstraction has 2721 states and 3550 transitions. [2022-07-14 04:55:55,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:55:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3550 transitions. [2022-07-14 04:55:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 04:55:55,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:55,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:55,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 04:55:55,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:55,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:55:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1845342809, now seen corresponding path program 3 times [2022-07-14 04:55:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:55,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419798408] [2022-07-14 04:55:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:56,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419798408] [2022-07-14 04:55:56,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419798408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86565897] [2022-07-14 04:55:56,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 04:55:56,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:55:56,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:55:56,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:55:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 04:55:56,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-14 04:55:56,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:55:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 04:55:56,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:55:56,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,770 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 04:55:56,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 22 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-14 04:55:56,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:56,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:55:56,808 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:55:56,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:56,924 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 04:55:56,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-14 04:55:56,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:56,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:57,004 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 04:55:57,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-14 04:55:57,090 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 04:55:57,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-14 04:55:57,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:55:57,219 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 04:55:57,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2022-07-14 04:55:57,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:55:57,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:57,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 04:55:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:55:57,340 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-14 04:55:57,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 26 [2022-07-14 04:55:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:55:57,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:55:57,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:55:57,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:55:57,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-14 04:55:57,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:55:57,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:55:57,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:55:57,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:55:57,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:55:57,574 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:57,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:57,663 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:57,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:57,710 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:55:57,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:55:57,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86565897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:55:57,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:55:57,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2022-07-14 04:55:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636664811] [2022-07-14 04:55:57,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:55:57,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 04:55:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 04:55:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=403, Unknown=4, NotChecked=172, Total=650 [2022-07-14 04:55:57,730 INFO L87 Difference]: Start difference. First operand 2721 states and 3550 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:06,299 INFO L93 Difference]: Finished difference Result 10237 states and 14400 transitions. [2022-07-14 04:56:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 04:56:06,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-07-14 04:56:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:06,328 INFO L225 Difference]: With dead ends: 10237 [2022-07-14 04:56:06,328 INFO L226 Difference]: Without dead ends: 8450 [2022-07-14 04:56:06,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1013, Unknown=4, NotChecked=276, Total=1482 [2022-07-14 04:56:06,335 INFO L413 NwaCegarLoop]: 4633 mSDtfsCounter, 4264 mSDsluCounter, 36022 mSDsCounter, 0 mSdLazyCounter, 10297 mSolverCounterSat, 1316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4798 SdHoareTripleChecker+Valid, 40655 SdHoareTripleChecker+Invalid, 13236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1316 IncrementalHoareTripleChecker+Valid, 10297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1623 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:06,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4798 Valid, 40655 Invalid, 13236 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1316 Valid, 10297 Invalid, 0 Unknown, 1623 Unchecked, 6.9s Time] [2022-07-14 04:56:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8450 states. [2022-07-14 04:56:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8450 to 3010. [2022-07-14 04:56:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2166 states have (on average 1.2774699907663896) internal successors, (2767), 2250 states have internal predecessors, (2767), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:56:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3896 transitions. [2022-07-14 04:56:06,642 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3896 transitions. Word has length 38 [2022-07-14 04:56:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:06,643 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 3896 transitions. [2022-07-14 04:56:06,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3896 transitions. [2022-07-14 04:56:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 04:56:06,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:06,644 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:06,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 04:56:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:06,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2121270696, now seen corresponding path program 4 times [2022-07-14 04:56:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503006301] [2022-07-14 04:56:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:07,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:07,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503006301] [2022-07-14 04:56:07,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503006301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:07,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906989568] [2022-07-14 04:56:07,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 04:56:07,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:56:07,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:56:07,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 04:56:07,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 04:56:07,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:56:07,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 04:56:07,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:56:07,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,722 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 04:56:07,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-14 04:56:07,737 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:56:07,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:07,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:56:07,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:07,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:07,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:07,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:07,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:07,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:08,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:08,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:08,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:56:08,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:56:08,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-07-14 04:56:08,221 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:56:08,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-14 04:56:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:08,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:56:11,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:56:11,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:56:11,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:56:12,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:56:12,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:56:12,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:56:12,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:56:12,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:56:12,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:56:12,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:56:12,089 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:12,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:12,179 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:12,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:12,233 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:12,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906989568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:12,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:56:12,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-14 04:56:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809803155] [2022-07-14 04:56:12,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:56:12,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 04:56:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 04:56:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=528, Unknown=8, NotChecked=306, Total=930 [2022-07-14 04:56:12,253 INFO L87 Difference]: Start difference. First operand 3010 states and 3896 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:17,651 INFO L93 Difference]: Finished difference Result 6232 states and 8179 transitions. [2022-07-14 04:56:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:56:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-07-14 04:56:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:17,665 INFO L225 Difference]: With dead ends: 6232 [2022-07-14 04:56:17,665 INFO L226 Difference]: Without dead ends: 4530 [2022-07-14 04:56:17,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=173, Invalid=899, Unknown=8, NotChecked=402, Total=1482 [2022-07-14 04:56:17,670 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2598 mSDsluCounter, 15645 mSDsCounter, 0 mSdLazyCounter, 5620 mSolverCounterSat, 1243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 17237 SdHoareTripleChecker+Invalid, 7509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1243 IncrementalHoareTripleChecker+Valid, 5620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:17,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 17237 Invalid, 7509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1243 Valid, 5620 Invalid, 0 Unknown, 646 Unchecked, 4.4s Time] [2022-07-14 04:56:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2022-07-14 04:56:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 3012. [2022-07-14 04:56:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 2168 states have (on average 1.2776752767527675) internal successors, (2770), 2252 states have internal predecessors, (2770), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:56:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3899 transitions. [2022-07-14 04:56:17,977 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3899 transitions. Word has length 40 [2022-07-14 04:56:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:17,978 INFO L495 AbstractCegarLoop]: Abstraction has 3012 states and 3899 transitions. [2022-07-14 04:56:17,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3899 transitions. [2022-07-14 04:56:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 04:56:17,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:17,979 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:18,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 04:56:18,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:18,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1367618104, now seen corresponding path program 4 times [2022-07-14 04:56:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048380037] [2022-07-14 04:56:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048380037] [2022-07-14 04:56:18,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048380037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357987785] [2022-07-14 04:56:18,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 04:56:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:56:18,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:56:18,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 04:56:18,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 04:56:18,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:56:18,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 04:56:18,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:56:18,854 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:56:18,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:18,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:56:18,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:18,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:56:18,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:19,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:19,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:19,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:19,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:19,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:19,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:19,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:19,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:56:19,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:56:19,383 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-14 04:56:19,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-14 04:56:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:19,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:56:28,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:28,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:28,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:28,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:28,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:28,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:56:28,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:56:28,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:56:28,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:56:28,792 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:28,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:28,891 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:28,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:28,944 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:28,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:28,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357987785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:28,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:56:28,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-14 04:56:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074834307] [2022-07-14 04:56:28,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:56:28,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 04:56:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:28,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 04:56:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=484, Unknown=7, NotChecked=240, Total=812 [2022-07-14 04:56:28,971 INFO L87 Difference]: Start difference. First operand 3012 states and 3899 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:38,439 INFO L93 Difference]: Finished difference Result 9654 states and 13729 transitions. [2022-07-14 04:56:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 04:56:38,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-07-14 04:56:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:38,457 INFO L225 Difference]: With dead ends: 9654 [2022-07-14 04:56:38,457 INFO L226 Difference]: Without dead ends: 7867 [2022-07-14 04:56:38,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=261, Invalid=1474, Unknown=7, NotChecked=420, Total=2162 [2022-07-14 04:56:38,462 INFO L413 NwaCegarLoop]: 5510 mSDtfsCounter, 4907 mSDsluCounter, 45330 mSDsCounter, 0 mSdLazyCounter, 11732 mSolverCounterSat, 1446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5546 SdHoareTripleChecker+Valid, 50840 SdHoareTripleChecker+Invalid, 15254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1446 IncrementalHoareTripleChecker+Valid, 11732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2076 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:38,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5546 Valid, 50840 Invalid, 15254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1446 Valid, 11732 Invalid, 0 Unknown, 2076 Unchecked, 7.3s Time] [2022-07-14 04:56:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-07-14 04:56:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 3020. [2022-07-14 04:56:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2176 states have (on average 1.2766544117647058) internal successors, (2778), 2260 states have internal predecessors, (2778), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:56:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 3907 transitions. [2022-07-14 04:56:38,852 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 3907 transitions. Word has length 41 [2022-07-14 04:56:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:38,852 INFO L495 AbstractCegarLoop]: Abstraction has 3020 states and 3907 transitions. [2022-07-14 04:56:38,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3907 transitions. [2022-07-14 04:56:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 04:56:38,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:38,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:38,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 04:56:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 04:56:39,076 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1262413276, now seen corresponding path program 1 times [2022-07-14 04:56:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241797141] [2022-07-14 04:56:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:56:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:39,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241797141] [2022-07-14 04:56:39,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241797141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:39,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:39,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 04:56:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359798366] [2022-07-14 04:56:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:39,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 04:56:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:39,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 04:56:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 04:56:39,164 INFO L87 Difference]: Start difference. First operand 3020 states and 3907 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:56:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:39,441 INFO L93 Difference]: Finished difference Result 3104 states and 4020 transitions. [2022-07-14 04:56:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 04:56:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-14 04:56:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:39,449 INFO L225 Difference]: With dead ends: 3104 [2022-07-14 04:56:39,449 INFO L226 Difference]: Without dead ends: 3102 [2022-07-14 04:56:39,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:56:39,451 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 33 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:39,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:56:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2022-07-14 04:56:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3036. [2022-07-14 04:56:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 2192 states have (on average 1.2746350364963503) internal successors, (2794), 2276 states have internal predecessors, (2794), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:56:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 3923 transitions. [2022-07-14 04:56:39,728 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 3923 transitions. Word has length 43 [2022-07-14 04:56:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:39,728 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 3923 transitions. [2022-07-14 04:56:39,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:56:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3923 transitions. [2022-07-14 04:56:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 04:56:39,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:39,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:39,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:56:39,730 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1262472858, now seen corresponding path program 1 times [2022-07-14 04:56:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404433576] [2022-07-14 04:56:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:56:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404433576] [2022-07-14 04:56:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404433576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:39,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244416052] [2022-07-14 04:56:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:39,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:39,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:39,833 INFO L87 Difference]: Start difference. First operand 3036 states and 3923 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:56:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:40,465 INFO L93 Difference]: Finished difference Result 5763 states and 7556 transitions. [2022-07-14 04:56:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:56:40,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-14 04:56:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:40,474 INFO L225 Difference]: With dead ends: 5763 [2022-07-14 04:56:40,474 INFO L226 Difference]: Without dead ends: 3018 [2022-07-14 04:56:40,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:56:40,483 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1161 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:40,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4295 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:56:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2022-07-14 04:56:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2022-07-14 04:56:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2175 states have (on average 1.2694252873563219) internal successors, (2761), 2258 states have internal predecessors, (2761), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:56:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3890 transitions. [2022-07-14 04:56:40,789 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3890 transitions. Word has length 43 [2022-07-14 04:56:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:40,790 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 3890 transitions. [2022-07-14 04:56:40,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:56:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3890 transitions. [2022-07-14 04:56:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 04:56:40,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:40,791 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:56:40,791 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1695222265, now seen corresponding path program 5 times [2022-07-14 04:56:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246827800] [2022-07-14 04:56:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246827800] [2022-07-14 04:56:41,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246827800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639365660] [2022-07-14 04:56:41,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 04:56:41,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:56:41,138 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:56:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 04:56:41,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-14 04:56:41,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:56:41,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 04:56:41,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:56:41,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:56:41,731 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:56:41,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:41,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:41,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:56:41,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:41,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:41,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:41,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:41,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:41,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:42,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:42,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:42,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:42,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:42,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:56:42,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:56:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:42,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 04:56:42,238 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-14 04:56:42,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-14 04:56:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:42,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:56:50,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:50,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:50,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-14 04:56:50,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-14 04:56:50,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:50,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-14 04:56:50,143 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:56:50,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:56:50,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:56:50,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:56:50,180 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:50,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:50,317 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:50,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:50,373 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:56:50,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:56:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639365660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:50,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:56:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-14 04:56:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196038167] [2022-07-14 04:56:50,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:56:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 04:56:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 04:56:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=15, NotChecked=366, Total=1260 [2022-07-14 04:56:50,404 INFO L87 Difference]: Start difference. First operand 3018 states and 3890 transitions. Second operand has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:57,578 INFO L93 Difference]: Finished difference Result 5832 states and 7692 transitions. [2022-07-14 04:56:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:56:57,579 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-14 04:56:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:57,590 INFO L225 Difference]: With dead ends: 5832 [2022-07-14 04:56:57,590 INFO L226 Difference]: Without dead ends: 4633 [2022-07-14 04:56:57,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=206, Invalid=1608, Unknown=16, NotChecked=522, Total=2352 [2022-07-14 04:56:57,594 INFO L413 NwaCegarLoop]: 1681 mSDtfsCounter, 2792 mSDsluCounter, 24015 mSDsCounter, 0 mSdLazyCounter, 9167 mSolverCounterSat, 1325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 25696 SdHoareTripleChecker+Invalid, 11167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1325 IncrementalHoareTripleChecker+Valid, 9167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:57,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 25696 Invalid, 11167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1325 Valid, 9167 Invalid, 0 Unknown, 675 Unchecked, 5.1s Time] [2022-07-14 04:56:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2022-07-14 04:56:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 3010. [2022-07-14 04:56:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2169 states have (on average 1.2701705855232825) internal successors, (2755), 2251 states have internal predecessors, (2755), 556 states have call successors, (556), 257 states have call predecessors, (556), 255 states have return successors, (571), 527 states have call predecessors, (571), 554 states have call successors, (571) [2022-07-14 04:56:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3882 transitions. [2022-07-14 04:56:57,945 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3882 transitions. Word has length 43 [2022-07-14 04:56:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:57,945 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 3882 transitions. [2022-07-14 04:56:57,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:56:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3882 transitions. [2022-07-14 04:56:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 04:56:57,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:57,946 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:57,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 04:56:58,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 04:56:58,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:56:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1045018631, now seen corresponding path program 5 times [2022-07-14 04:56:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:58,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80893139] [2022-07-14 04:56:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80893139] [2022-07-14 04:56:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80893139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:56:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143798250] [2022-07-14 04:56:58,293 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 04:56:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:56:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:56:58,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:56:58,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 04:56:58,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-14 04:56:58,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:56:58,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 04:56:58,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:56:58,929 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 04:56:58,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:58,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:56:58,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:56:58,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:56:59,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:59,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:59,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:59,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:59,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:59,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:59,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:59,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:56:59,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:56:59,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:56:59,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:56:59,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 04:56:59,479 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:56:59,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-14 04:56:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:56:59,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:57:04,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:57:04,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:57:04,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:57:04,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:57:04,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:57:04,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:57:04,857 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:57:04,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:57:04,953 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:57:04,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:57:05,003 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:57:05,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:57:05,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143798250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:57:05,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:57:05,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2022-07-14 04:57:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758638259] [2022-07-14 04:57:05,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:57:05,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 04:57:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 04:57:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=530, Unknown=8, NotChecked=364, Total=992 [2022-07-14 04:57:05,024 INFO L87 Difference]: Start difference. First operand 3010 states and 3882 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:57:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:32,415 INFO L93 Difference]: Finished difference Result 12182 states and 17402 transitions. [2022-07-14 04:57:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 04:57:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-14 04:57:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:32,494 INFO L225 Difference]: With dead ends: 12182 [2022-07-14 04:57:32,494 INFO L226 Difference]: Without dead ends: 10393 [2022-07-14 04:57:32,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=245, Invalid=1497, Unknown=8, NotChecked=602, Total=2352 [2022-07-14 04:57:32,512 INFO L413 NwaCegarLoop]: 6412 mSDtfsCounter, 6006 mSDsluCounter, 59848 mSDsCounter, 0 mSdLazyCounter, 22451 mSolverCounterSat, 2397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6750 SdHoareTripleChecker+Valid, 66260 SdHoareTripleChecker+Invalid, 26795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2397 IncrementalHoareTripleChecker+Valid, 22451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1947 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:32,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6750 Valid, 66260 Invalid, 26795 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2397 Valid, 22451 Invalid, 0 Unknown, 1947 Unchecked, 23.9s Time] [2022-07-14 04:57:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2022-07-14 04:57:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 3020. [2022-07-14 04:57:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2177 states have (on average 1.2691777675700506) internal successors, (2763), 2260 states have internal predecessors, (2763), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:57:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 3892 transitions. [2022-07-14 04:57:33,044 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 3892 transitions. Word has length 44 [2022-07-14 04:57:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:33,045 INFO L495 AbstractCegarLoop]: Abstraction has 3020 states and 3892 transitions. [2022-07-14 04:57:33,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:57:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3892 transitions. [2022-07-14 04:57:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 04:57:33,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:33,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:33,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 04:57:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 04:57:33,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:57:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash -460727510, now seen corresponding path program 1 times [2022-07-14 04:57:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010322001] [2022-07-14 04:57:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:57:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:57:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010322001] [2022-07-14 04:57:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010322001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:33,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:33,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 04:57:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122697083] [2022-07-14 04:57:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:57:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:57:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:57:33,337 INFO L87 Difference]: Start difference. First operand 3020 states and 3892 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:57:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:33,701 INFO L93 Difference]: Finished difference Result 5729 states and 7492 transitions. [2022-07-14 04:57:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:57:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-07-14 04:57:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:33,708 INFO L225 Difference]: With dead ends: 5729 [2022-07-14 04:57:33,708 INFO L226 Difference]: Without dead ends: 3002 [2022-07-14 04:57:33,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:57:33,714 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:33,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:57:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-07-14 04:57:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-07-14 04:57:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2160 states have (on average 1.2638888888888888) internal successors, (2730), 2242 states have internal predecessors, (2730), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-14 04:57:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3859 transitions. [2022-07-14 04:57:34,037 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3859 transitions. Word has length 47 [2022-07-14 04:57:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:34,037 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 3859 transitions. [2022-07-14 04:57:34,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 04:57:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3859 transitions. [2022-07-14 04:57:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 04:57:34,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:34,039 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:34,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:57:34,039 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:57:34,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash -914774024, now seen corresponding path program 6 times [2022-07-14 04:57:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:34,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269477981] [2022-07-14 04:57:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:57:34,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:34,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269477981] [2022-07-14 04:57:34,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269477981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:57:34,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749387483] [2022-07-14 04:57:34,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 04:57:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:57:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:57:34,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:57:34,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 04:57:35,798 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-14 04:57:35,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:57:35,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 233 conjunts are in the unsatisfiable core [2022-07-14 04:57:35,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:57:43,668 INFO L356 Elim1Store]: treesize reduction 328, result has 50.1 percent of original size [2022-07-14 04:57:43,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 83 select indices, 83 select index equivalence classes, 3321 disjoint index pairs (out of 3403 index pairs), introduced 83 new quantified variables, introduced 82 case distinctions, treesize of input 416 treesize of output 578 [2022-07-14 04:57:44,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 103 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-14 04:57:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:44,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 103 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-14 04:57:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:48,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:57:49,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:49,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:49,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:57:51,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:51,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:51,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:57:51,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:51,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:57:54,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:54,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:54,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:57:55,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:55,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:57:58,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:58,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:58,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:57:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:57:58,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:58:00,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:00,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:00,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:58:01,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:01,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:58:04,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:04,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 04:58:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:04,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:04,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-14 04:58:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:07,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 04:58:07,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:07,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 04:58:10,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:10,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 83 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 04:58:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 04:58:10,700 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 04:58:10,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 84 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-14 04:58:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:58:10,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:58:11,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:58:12,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-14 04:58:12,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-14 04:58:12,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:58:12,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-14 04:58:12,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-14 04:58:12,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-14 04:58:12,341 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:58:12,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:58:12,479 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:58:12,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:58:12,529 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-14 04:58:12,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 04:58:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749387483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:58:12,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:58:12,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-14 04:58:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239670745] [2022-07-14 04:58:12,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:58:12,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 04:58:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 04:58:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=676, Unknown=9, NotChecked=540, Total=1332 [2022-07-14 04:58:12,549 INFO L87 Difference]: Start difference. First operand 3002 states and 3859 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:58:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:43,572 INFO L93 Difference]: Finished difference Result 5913 states and 7827 transitions. [2022-07-14 04:58:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 04:58:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-14 04:58:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:43,582 INFO L225 Difference]: With dead ends: 5913 [2022-07-14 04:58:43,582 INFO L226 Difference]: Without dead ends: 4720 [2022-07-14 04:58:43,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=212, Invalid=1221, Unknown=9, NotChecked=720, Total=2162 [2022-07-14 04:58:43,586 INFO L413 NwaCegarLoop]: 1702 mSDtfsCounter, 2757 mSDsluCounter, 17207 mSDsCounter, 0 mSdLazyCounter, 7812 mSolverCounterSat, 1339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 18909 SdHoareTripleChecker+Invalid, 9177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1339 IncrementalHoareTripleChecker+Valid, 7812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:43,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 18909 Invalid, 9177 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1339 Valid, 7812 Invalid, 0 Unknown, 26 Unchecked, 12.8s Time] [2022-07-14 04:58:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2022-07-14 04:58:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 2997. [2022-07-14 04:58:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2157 states have (on average 1.2651831247102456) internal successors, (2729), 2238 states have internal predecessors, (2729), 556 states have call successors, (556), 257 states have call predecessors, (556), 255 states have return successors, (571), 527 states have call predecessors, (571), 554 states have call successors, (571) [2022-07-14 04:58:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3856 transitions. [2022-07-14 04:58:44,362 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3856 transitions. Word has length 46 [2022-07-14 04:58:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:44,362 INFO L495 AbstractCegarLoop]: Abstraction has 2997 states and 3856 transitions. [2022-07-14 04:58:44,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 04:58:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3856 transitions. [2022-07-14 04:58:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 04:58:44,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:44,363 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:58:44,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 04:58:44,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 04:58:44,579 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-14 04:58:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1674040360, now seen corresponding path program 6 times [2022-07-14 04:58:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:44,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425367348] [2022-07-14 04:58:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:58:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425367348] [2022-07-14 04:58:44,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425367348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:58:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480385303] [2022-07-14 04:58:44,716 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 04:58:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:58:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:58:44,717 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:58:44,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 04:58:46,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-14 04:58:46,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:58:46,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 1459 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 04:58:46,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:58:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:58:46,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:58:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 04:58:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480385303] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:58:46,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:58:46,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-07-14 04:58:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364949586] [2022-07-14 04:58:46,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:58:46,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:58:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:58:46,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:58:46,291 INFO L87 Difference]: Start difference. First operand 2997 states and 3856 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:58:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:53,388 INFO L93 Difference]: Finished difference Result 10266 states and 14698 transitions. [2022-07-14 04:58:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:58:53,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-07-14 04:58:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:53,408 INFO L225 Difference]: With dead ends: 10266 [2022-07-14 04:58:53,408 INFO L226 Difference]: Without dead ends: 8480 [2022-07-14 04:58:53,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:58:53,415 INFO L413 NwaCegarLoop]: 5103 mSDtfsCounter, 2396 mSDsluCounter, 31278 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3266 SdHoareTripleChecker+Valid, 36381 SdHoareTripleChecker+Invalid, 7388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:53,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3266 Valid, 36381 Invalid, 7388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 7333 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 04:58:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8480 states. [2022-07-14 04:58:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8480 to 2890. [2022-07-14 04:58:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2085 states have (on average 1.2623501199040768) internal successors, (2632), 2156 states have internal predecessors, (2632), 536 states have call successors, (536), 244 states have call predecessors, (536), 241 states have return successors, (549), 514 states have call predecessors, (549), 534 states have call successors, (549) [2022-07-14 04:58:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3717 transitions. [2022-07-14 04:58:54,394 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3717 transitions. Word has length 47 [2022-07-14 04:58:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 2890 states and 3717 transitions. [2022-07-14 04:58:54,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 04:58:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3717 transitions. [2022-07-14 04:58:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 04:58:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:54,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:58:54,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 04:58:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 04:58:54,606 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 29 more)] === [2022-07-14 04:58:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2094288900, now seen corresponding path program 1 times [2022-07-14 04:58:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28787210] [2022-07-14 04:58:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:58:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:58:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:58:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:58:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:58:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:58:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:54,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28787210] [2022-07-14 04:58:54,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28787210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:54,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:54,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 04:58:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049350243] [2022-07-14 04:58:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:58:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:58:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:58:54,673 INFO L87 Difference]: Start difference. First operand 2890 states and 3717 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:58:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:56,846 INFO L93 Difference]: Finished difference Result 4560 states and 5895 transitions. [2022-07-14 04:58:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:58:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-14 04:58:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:56,853 INFO L225 Difference]: With dead ends: 4560 [2022-07-14 04:58:56,854 INFO L226 Difference]: Without dead ends: 3316 [2022-07-14 04:58:56,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:56,859 INFO L413 NwaCegarLoop]: 1453 mSDtfsCounter, 1207 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:56,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2903 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 04:58:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2022-07-14 04:58:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 2891. [2022-07-14 04:58:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2086 states have (on average 1.2622243528283796) internal successors, (2633), 2157 states have internal predecessors, (2633), 536 states have call successors, (536), 244 states have call predecessors, (536), 241 states have return successors, (549), 514 states have call predecessors, (549), 534 states have call successors, (549) [2022-07-14 04:58:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3718 transitions. [2022-07-14 04:58:57,677 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3718 transitions. Word has length 52 [2022-07-14 04:58:57,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:57,677 INFO L495 AbstractCegarLoop]: Abstraction has 2891 states and 3718 transitions. [2022-07-14 04:58:57,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:58:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3718 transitions. [2022-07-14 04:58:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 04:58:57,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:57,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:58:57,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:58:57,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 29 more)] === [2022-07-14 04:58:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1952531902, now seen corresponding path program 1 times [2022-07-14 04:58:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838482635] [2022-07-14 04:58:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:58:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:58:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:58:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:58:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:58:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:58:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:57,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838482635] [2022-07-14 04:58:57,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838482635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:57,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:57,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480433032] [2022-07-14 04:58:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:57,793 INFO L87 Difference]: Start difference. First operand 2891 states and 3718 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:58:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:59,664 INFO L93 Difference]: Finished difference Result 2891 states and 3718 transitions. [2022-07-14 04:58:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-14 04:58:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:59,671 INFO L225 Difference]: With dead ends: 2891 [2022-07-14 04:58:59,671 INFO L226 Difference]: Without dead ends: 2889 [2022-07-14 04:58:59,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 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-14 04:58:59,673 INFO L413 NwaCegarLoop]: 1063 mSDtfsCounter, 1755 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:59,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 2149 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 04:58:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-07-14 04:59:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2889. [2022-07-14 04:59:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2085 states have (on average 1.2618705035971223) internal successors, (2631), 2155 states have internal predecessors, (2631), 536 states have call successors, (536), 244 states have call predecessors, (536), 241 states have return successors, (549), 514 states have call predecessors, (549), 534 states have call successors, (549) [2022-07-14 04:59:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3716 transitions. [2022-07-14 04:59:00,542 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3716 transitions. Word has length 52 [2022-07-14 04:59:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:59:00,543 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 3716 transitions. [2022-07-14 04:59:00,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:59:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3716 transitions. [2022-07-14 04:59:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 04:59:00,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:59:00,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:59:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:59:00,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 29 more)] === [2022-07-14 04:59:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:59:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 805801132, now seen corresponding path program 1 times [2022-07-14 04:59:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:59:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317991467] [2022-07-14 04:59:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:59:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:59:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:59:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:59:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:59:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:59:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:59:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:59:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:59:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:59:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:59:00,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317991467] [2022-07-14 04:59:00,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317991467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:59:00,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:59:00,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:59:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821496511] [2022-07-14 04:59:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:59:00,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:59:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:59:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:59:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:59:00,638 INFO L87 Difference]: Start difference. First operand 2889 states and 3716 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 04:59:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:59:02,495 INFO L93 Difference]: Finished difference Result 2889 states and 3716 transitions. [2022-07-14 04:59:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:59:02,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2022-07-14 04:59:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:59:02,501 INFO L225 Difference]: With dead ends: 2889 [2022-07-14 04:59:02,502 INFO L226 Difference]: Without dead ends: 2887 [2022-07-14 04:59:02,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-14 04:59:02,503 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 1749 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:59:02,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 2147 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 04:59:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-07-14 04:59:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2887. [2022-07-14 04:59:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2084 states have (on average 1.2615163147792707) internal successors, (2629), 2153 states have internal predecessors, (2629), 536 states have call successors, (536), 244 states have call predecessors, (536), 241 states have return successors, (549), 514 states have call predecessors, (549), 534 states have call successors, (549) [2022-07-14 04:59:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3714 transitions. [2022-07-14 04:59:03,297 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3714 transitions. Word has length 58 [2022-07-14 04:59:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:59:03,297 INFO L495 AbstractCegarLoop]: Abstraction has 2887 states and 3714 transitions. [2022-07-14 04:59:03,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 04:59:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3714 transitions. [2022-07-14 04:59:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:59:03,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:59:03,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:59:03,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:59:03,300 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 29 more)] === [2022-07-14 04:59:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:59:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1631090702, now seen corresponding path program 1 times [2022-07-14 04:59:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:59:03,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470695002] [2022-07-14 04:59:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:59:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:59:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:59:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:59:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:59:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:59:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:59:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:59:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:59:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:59:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:59:03,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:59:03,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470695002] [2022-07-14 04:59:03,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470695002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:59:03,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:59:03,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:59:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010068528] [2022-07-14 04:59:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:59:03,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:59:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:59:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:59:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:59:03,397 INFO L87 Difference]: Start difference. First operand 2887 states and 3714 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:59:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:59:05,264 INFO L93 Difference]: Finished difference Result 2887 states and 3714 transitions. [2022-07-14 04:59:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:59:05,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-14 04:59:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:59:05,270 INFO L225 Difference]: With dead ends: 2887 [2022-07-14 04:59:05,270 INFO L226 Difference]: Without dead ends: 2885 [2022-07-14 04:59:05,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-14 04:59:05,271 INFO L413 NwaCegarLoop]: 1059 mSDtfsCounter, 1743 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:59:05,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 2145 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 04:59:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2022-07-14 04:59:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2885. [2022-07-14 04:59:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2083 states have (on average 1.2611617858857418) internal successors, (2627), 2151 states have internal predecessors, (2627), 536 states have call successors, (536), 244 states have call predecessors, (536), 241 states have return successors, (549), 514 states have call predecessors, (549), 534 states have call successors, (549) [2022-07-14 04:59:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 3712 transitions. [2022-07-14 04:59:06,042 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 3712 transitions. Word has length 64 [2022-07-14 04:59:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:59:06,042 INFO L495 AbstractCegarLoop]: Abstraction has 2885 states and 3712 transitions. [2022-07-14 04:59:06,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:59:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 3712 transitions. [2022-07-14 04:59:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:59:06,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:59:06,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:59:06,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:59:06,044 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 29 more)] === [2022-07-14 04:59:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:59:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 118265499, now seen corresponding path program 1 times [2022-07-14 04:59:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:59:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949533239] [2022-07-14 04:59:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:59:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:59:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:59:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:59:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 04:59:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:59:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 04:59:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:59:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:59:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:59:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:59:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:59:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:59:06,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949533239] [2022-07-14 04:59:06,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949533239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:59:06,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:59:06,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:59:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611029970] [2022-07-14 04:59:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:59:06,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:59:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:59:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:59:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:59:06,148 INFO L87 Difference]: Start difference. First operand 2885 states and 3712 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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)