./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 e19ca921 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-dev-e19ca92 [2021-12-22 16:07:12,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:07:12,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:07:12,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:07:12,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:07:12,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:07:12,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:07:12,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:07:12,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:07:12,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:07:12,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:07:12,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:07:12,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:07:12,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:07:12,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:07:12,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:07:12,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:07:12,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:07:12,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:07:12,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:07:12,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:07:12,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:07:12,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:07:12,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:07:12,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:07:12,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:07:12,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:07:12,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:07:12,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:07:12,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:07:12,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:07:12,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:07:12,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:07:12,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:07:12,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:07:12,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:07:12,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:07:12,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:07:12,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:07:12,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:07:12,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:07:12,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-22 16:07:12,172 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:07:12,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:07:12,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:07:12,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:07:12,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:07:12,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:07:12,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:07:12,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:07:12,174 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:07:12,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:07:12,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 16:07:12,175 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:07:12,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 16:07:12,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:07:12,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:07:12,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:07:12,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:07:12,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 16:07:12,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 16:07:12,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:07:12,178 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 [2021-12-22 16:07:12,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:07:12,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:07:12,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:07:12,404 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:07:12,405 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:07:12,405 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 [2021-12-22 16:07:12,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e57e27ca/e7e60a42426341118ab23d55c72ebefa/FLAG455d82dbb [2021-12-22 16:07:13,062 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:07:13,065 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 [2021-12-22 16:07:13,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e57e27ca/e7e60a42426341118ab23d55c72ebefa/FLAG455d82dbb [2021-12-22 16:07:13,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e57e27ca/e7e60a42426341118ab23d55c72ebefa [2021-12-22 16:07:13,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:07:13,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:07:13,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:07:13,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:07:13,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:07:13,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:07:13" (1/1) ... [2021-12-22 16:07:13,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4852ee3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:13, skipping insertion in model container [2021-12-22 16:07:13,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:07:13" (1/1) ... [2021-12-22 16:07:13,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:07:13,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:07:14,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242846,242859] [2021-12-22 16:07:14,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243008,243021] [2021-12-22 16:07:14,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243167,243180] [2021-12-22 16:07:14,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243313,243326] [2021-12-22 16:07:14,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243456,243469] [2021-12-22 16:07:14,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243600,243613] [2021-12-22 16:07:14,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243743,243756] [2021-12-22 16:07:14,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243887,243900] [2021-12-22 16:07:14,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244028,244041] [2021-12-22 16:07:14,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244166,244179] [2021-12-22 16:07:14,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244324,244337] [2021-12-22 16:07:14,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244483,244496] [2021-12-22 16:07:14,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244639,244652] [2021-12-22 16:07:14,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244788,244801] [2021-12-22 16:07:14,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244940,244953] [2021-12-22 16:07:14,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245091,245104] [2021-12-22 16:07:14,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245240,245253] [2021-12-22 16:07:14,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245392,245405] [2021-12-22 16:07:14,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245540,245553] [2021-12-22 16:07:14,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245693,245706] [2021-12-22 16:07:14,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245844,245857] [2021-12-22 16:07:14,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245994,246007] [2021-12-22 16:07:14,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246141,246154] [2021-12-22 16:07:14,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246292,246305] [2021-12-22 16:07:14,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246443,246456] [2021-12-22 16:07:14,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246591,246604] [2021-12-22 16:07:14,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246757,246770] [2021-12-22 16:07:14,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246926,246939] [2021-12-22 16:07:14,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247093,247106] [2021-12-22 16:07:14,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:14,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[248051,248064] [2021-12-22 16:07:14,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:07:14,928 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:07:15,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234663,234676] [2021-12-22 16:07:15,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234808,234821] [2021-12-22 16:07:15,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234954,234967] [2021-12-22 16:07:15,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235119,235132] [2021-12-22 16:07:15,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235277,235290] [2021-12-22 16:07:15,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235435,235448] [2021-12-22 16:07:15,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235593,235606] [2021-12-22 16:07:15,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235753,235766] [2021-12-22 16:07:15,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235912,235925] [2021-12-22 16:07:15,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236051,236064] [2021-12-22 16:07:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236193,236206] [2021-12-22 16:07:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236342,236355] [2021-12-22 16:07:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236481,236494] [2021-12-22 16:07:15,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236636,236649] [2021-12-22 16:07:15,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236796,236809] [2021-12-22 16:07:15,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236947,236960] [2021-12-22 16:07:15,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237098,237111] [2021-12-22 16:07:15,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237250,237263] [2021-12-22 16:07:15,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237399,237412] [2021-12-22 16:07:15,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2021-12-22 16:07:15,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:07:15,206 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:07:15,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15 WrapperNode [2021-12-22 16:07:15,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:07:15,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:07:15,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:07:15,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:07:15,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,339 INFO L137 Inliner]: procedures = 486, calls = 1092, calls flagged for inlining = 196, calls inlined = 121, statements flattened = 1951 [2021-12-22 16:07:15,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:07:15,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:07:15,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:07:15,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:07:15,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:07:15,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:07:15,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:07:15,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:07:15,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (1/1) ... [2021-12-22 16:07:15,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:07:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:15,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:07:15,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:07:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2021-12-22 16:07:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-22 16:07:15,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-22 16:07:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-22 16:07:15,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-22 16:07:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2021-12-22 16:07:15,526 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2021-12-22 16:07:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-22 16:07:15,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-22 16:07:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2021-12-22 16:07:15,526 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2021-12-22 16:07:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_lock [2021-12-22 16:07:15,526 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_lock [2021-12-22 16:07:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-22 16:07:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-22 16:07:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2021-12-22 16:07:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2021-12-22 16:07:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-22 16:07:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-22 16:07:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2021-12-22 16:07:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2021-12-22 16:07:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-22 16:07:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-22 16:07:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2021-12-22 16:07:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2021-12-22 16:07:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-22 16:07:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-22 16:07:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_delay [2021-12-22 16:07:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_delay [2021-12-22 16:07:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_delay [2021-12-22 16:07:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_delay [2021-12-22 16:07:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-22 16:07:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-22 16:07:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-22 16:07:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-22 16:07:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-22 16:07:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-22 16:07:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2021-12-22 16:07:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2021-12-22 16:07:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:07:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2021-12-22 16:07:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2021-12-22 16:07:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-22 16:07:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-22 16:07:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-22 16:07:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-22 16:07:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_lock_irq [2021-12-22 16:07:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_lock_irq [2021-12-22 16:07:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2021-12-22 16:07:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2021-12-22 16:07:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-22 16:07:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-22 16:07:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-22 16:07:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-22 16:07:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-22 16:07:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-22 16:07:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:07:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-22 16:07:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-22 16:07:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-22 16:07:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-22 16:07:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-22 16:07:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-22 16:07:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2021-12-22 16:07:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2021-12-22 16:07:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-22 16:07:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-22 16:07:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_write [2021-12-22 16:07:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_write [2021-12-22 16:07:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-22 16:07:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-22 16:07:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2021-12-22 16:07:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2021-12-22 16:07:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-22 16:07:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-22 16:07:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_lock [2021-12-22 16:07:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_lock [2021-12-22 16:07:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:07:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_read [2021-12-22 16:07:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_read [2021-12-22 16:07:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2021-12-22 16:07:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2021-12-22 16:07:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_unlock [2021-12-22 16:07:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_unlock [2021-12-22 16:07:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:07:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_write [2021-12-22 16:07:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_write [2021-12-22 16:07:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-22 16:07:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-22 16:07:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_unlock_irq [2021-12-22 16:07:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_unlock_irq [2021-12-22 16:07:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2021-12-22 16:07:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2021-12-22 16:07:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:07:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2021-12-22 16:07:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2021-12-22 16:07:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-22 16:07:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_read [2021-12-22 16:07:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_read [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_write_delay [2021-12-22 16:07:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_write_delay [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2021-12-22 16:07:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:07:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-22 16:07:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-22 16:07:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-22 16:07:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-22 16:07:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2021-12-22 16:07:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2021-12-22 16:07:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2021-12-22 16:07:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2021-12-22 16:07:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock_irq [2021-12-22 16:07:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock_irq [2021-12-22 16:07:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-22 16:07:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-22 16:07:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-22 16:07:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-22 16:07:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 16:07:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-22 16:07:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-22 16:07:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:07:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 16:07:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_read_lock [2021-12-22 16:07:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_read_lock [2021-12-22 16:07:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-22 16:07:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-22 16:07:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-22 16:07:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-22 16:07:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2021-12-22 16:07:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2021-12-22 16:07:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock_irq [2021-12-22 16:07:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock_irq [2021-12-22 16:07:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-22 16:07:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-22 16:07:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-22 16:07:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-22 16:07:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_read_delay [2021-12-22 16:07:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_read_delay [2021-12-22 16:07:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-22 16:07:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-22 16:07:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2021-12-22 16:07:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-22 16:07:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_delay [2021-12-22 16:07:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_delay [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-22 16:07:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-22 16:07:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-22 16:07:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-22 16:07:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-22 16:07:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-22 16:07:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:07:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-22 16:07:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-22 16:07:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2021-12-22 16:07:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2021-12-22 16:07:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-22 16:07:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-22 16:07:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure __torture_print_stats [2021-12-22 16:07:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __torture_print_stats [2021-12-22 16:07:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2021-12-22 16:07:15,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2021-12-22 16:07:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-22 16:07:15,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-22 16:07:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock [2021-12-22 16:07:15,547 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock [2021-12-22 16:07:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock [2021-12-22 16:07:15,547 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock [2021-12-22 16:07:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:07:15,862 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:07:15,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:07:16,072 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-22 16:07:16,782 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:07:16,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:07:16,797 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 16:07:16,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:07:16 BoogieIcfgContainer [2021-12-22 16:07:16,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:07:16,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:07:16,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:07:16,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:07:16,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:07:13" (1/3) ... [2021-12-22 16:07:16,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269d8b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:07:16, skipping insertion in model container [2021-12-22 16:07:16,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:07:15" (2/3) ... [2021-12-22 16:07:16,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269d8b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:07:16, skipping insertion in model container [2021-12-22 16:07:16,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:07:16" (3/3) ... [2021-12-22 16:07:16,806 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2021-12-22 16:07:16,809 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:07:16,809 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-22 16:07:16,849 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:07:16,853 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:07:16,853 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-22 16:07:16,888 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) [2021-12-22 16:07:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:07:16,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:16,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:16,904 INFO L402 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)] === [2021-12-22 16:07:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -192389351, now seen corresponding path program 1 times [2021-12-22 16:07:16,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:16,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717435082] [2021-12-22 16:07:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:16,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:17,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:17,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717435082] [2021-12-22 16:07:17,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717435082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:17,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:17,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:07:17,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188789912] [2021-12-22 16:07:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:17,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:07:17,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:07:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:07:17,277 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) [2021-12-22 16:07:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:17,486 INFO L93 Difference]: Finished difference Result 2259 states and 3174 transitions. [2021-12-22 16:07:17,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:07:17,488 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 [2021-12-22 16:07:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:17,502 INFO L225 Difference]: With dead ends: 2259 [2021-12-22 16:07:17,502 INFO L226 Difference]: Without dead ends: 1290 [2021-12-22 16:07:17,509 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:17,511 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 314 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:17,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 2915 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:07:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-12-22 16:07:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 945. [2021-12-22 16:07:17,602 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) [2021-12-22 16:07:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1188 transitions. [2021-12-22 16:07:17,607 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1188 transitions. Word has length 26 [2021-12-22 16:07:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:17,607 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1188 transitions. [2021-12-22 16:07:17,607 INFO L471 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) [2021-12-22 16:07:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1188 transitions. [2021-12-22 16:07:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:07:17,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:17,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:17,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:07:17,610 INFO L402 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)] === [2021-12-22 16:07:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789480, now seen corresponding path program 1 times [2021-12-22 16:07:17,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:17,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589581963] [2021-12-22 16:07:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:17,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:18,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:18,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589581963] [2021-12-22 16:07:18,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589581963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:18,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:18,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:07:18,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079310935] [2021-12-22 16:07:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:18,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:07:18,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:07:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:07:18,064 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) [2021-12-22 16:07:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:19,924 INFO L93 Difference]: Finished difference Result 2964 states and 3704 transitions. [2021-12-22 16:07:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:07:19,924 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 [2021-12-22 16:07:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:19,933 INFO L225 Difference]: With dead ends: 2964 [2021-12-22 16:07:19,933 INFO L226 Difference]: Without dead ends: 2053 [2021-12-22 16:07:19,957 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:19,958 INFO L933 BasicCegarLoop]: 1736 mSDtfsCounter, 1437 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 10023 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:19,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 10023 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:07:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2021-12-22 16:07:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1793. [2021-12-22 16:07:20,035 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) [2021-12-22 16:07:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2276 transitions. [2021-12-22 16:07:20,044 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2276 transitions. Word has length 28 [2021-12-22 16:07:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:20,045 INFO L470 AbstractCegarLoop]: Abstraction has 1793 states and 2276 transitions. [2021-12-22 16:07:20,045 INFO L471 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) [2021-12-22 16:07:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2276 transitions. [2021-12-22 16:07:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 16:07:20,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:20,050 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:07:20,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:07:20,050 INFO L402 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)] === [2021-12-22 16:07:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1675116871, now seen corresponding path program 1 times [2021-12-22 16:07:20,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:20,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113045530] [2021-12-22 16:07:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:20,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:20,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113045530] [2021-12-22 16:07:20,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113045530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495224011] [2021-12-22 16:07:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:20,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:20,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:20,423 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) [2021-12-22 16:07:20,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:07:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-22 16:07:20,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:07:21,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,085 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 16:07:21,086 INFO L387 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 [2021-12-22 16:07:21,101 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:07:21,102 INFO L387 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 [2021-12-22 16:07:21,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:21,130 INFO L387 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 [2021-12-22 16:07:21,263 INFO L387 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 [2021-12-22 16:07:21,272 INFO L387 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 [2021-12-22 16:07:21,385 INFO L387 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 [2021-12-22 16:07:21,389 INFO L387 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 [2021-12-22 16:07:21,494 INFO L387 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 [2021-12-22 16:07:21,501 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:07:21,502 INFO L387 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 [2021-12-22 16:07:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:21,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:07:22,106 WARN L838 $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 [2021-12-22 16:07:24,906 WARN L838 $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 [2021-12-22 16:07:24,920 WARN L838 $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 [2021-12-22 16:07:24,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:07:24,976 INFO L387 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 [2021-12-22 16:07:24,986 INFO L387 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 [2021-12-22 16:07:24,992 INFO L387 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 [2021-12-22 16:07:25,032 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:25,033 INFO L387 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 [2021-12-22 16:07:25,208 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:25,209 INFO L387 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 [2021-12-22 16:07:25,297 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:25,297 INFO L387 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 [2021-12-22 16:07:25,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495224011] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:25,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:07:25,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-12-22 16:07:25,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558024321] [2021-12-22 16:07:25,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:07:25,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 16:07:25,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 16:07:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=369, Unknown=10, NotChecked=120, Total=552 [2021-12-22 16:07:25,322 INFO L87 Difference]: Start difference. First operand 1793 states and 2276 transitions. Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 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) [2021-12-22 16:07:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:29,701 INFO L93 Difference]: Finished difference Result 4149 states and 5279 transitions. [2021-12-22 16:07:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:07:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 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 [2021-12-22 16:07:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:29,711 INFO L225 Difference]: With dead ends: 4149 [2021-12-22 16:07:29,711 INFO L226 Difference]: Without dead ends: 2391 [2021-12-22 16:07:29,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=128, Invalid=743, Unknown=11, NotChecked=174, Total=1056 [2021-12-22 16:07:29,719 INFO L933 BasicCegarLoop]: 1474 mSDtfsCounter, 1941 mSDsluCounter, 16899 mSDsCounter, 0 mSdLazyCounter, 4317 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 18373 SdHoareTripleChecker+Invalid, 5819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 4317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:29,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1941 Valid, 18373 Invalid, 5819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 4317 Invalid, 0 Unknown, 570 Unchecked, 3.2s Time] [2021-12-22 16:07:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2021-12-22 16:07:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2049. [2021-12-22 16:07:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2049 states, 1443 states have (on average 1.2661122661122661) internal successors, (1827), 1517 states have internal predecessors, (1827), 395 states have call successors, (395), 182 states have call predecessors, (395), 180 states have return successors, (402), 375 states have call predecessors, (402), 393 states have call successors, (402) [2021-12-22 16:07:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2624 transitions. [2021-12-22 16:07:29,808 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2624 transitions. Word has length 31 [2021-12-22 16:07:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:29,808 INFO L470 AbstractCegarLoop]: Abstraction has 2049 states and 2624 transitions. [2021-12-22 16:07:29,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 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) [2021-12-22 16:07:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2624 transitions. [2021-12-22 16:07:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 16:07:29,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:29,810 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:07:29,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:07:30,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:30,027 INFO L402 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)] === [2021-12-22 16:07:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash 356279481, now seen corresponding path program 1 times [2021-12-22 16:07:30,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:30,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469301345] [2021-12-22 16:07:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:30,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:30,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469301345] [2021-12-22 16:07:30,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469301345] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903524882] [2021-12-22 16:07:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:30,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:30,157 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) [2021-12-22 16:07:30,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 16:07:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:30,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-22 16:07:30,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:07:30,594 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:07:30,594 INFO L387 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 [2021-12-22 16:07:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,613 INFO L387 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 [2021-12-22 16:07:30,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:30,631 INFO L387 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 [2021-12-22 16:07:30,750 INFO L387 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 [2021-12-22 16:07:30,756 INFO L387 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 [2021-12-22 16:07:30,830 INFO L387 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 [2021-12-22 16:07:30,836 INFO L387 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 [2021-12-22 16:07:30,957 INFO L387 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 [2021-12-22 16:07:30,962 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:07:30,963 INFO L387 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 [2021-12-22 16:07:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:30,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:07:31,723 WARN L838 $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 [2021-12-22 16:07:34,082 WARN L838 $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 [2021-12-22 16:07:34,093 WARN L838 $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 [2021-12-22 16:07:34,129 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:07:34,130 INFO L387 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 [2021-12-22 16:07:34,135 INFO L387 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 [2021-12-22 16:07:34,139 INFO L387 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 [2021-12-22 16:07:34,175 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:34,175 INFO L387 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 [2021-12-22 16:07:34,332 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:34,332 INFO L387 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 [2021-12-22 16:07:34,387 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:34,388 INFO L387 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 [2021-12-22 16:07:34,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903524882] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:34,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:07:34,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2021-12-22 16:07:34,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132251781] [2021-12-22 16:07:34,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:07:34,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:07:34,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:34,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:07:34,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=227, Unknown=7, NotChecked=96, Total=380 [2021-12-22 16:07:34,409 INFO L87 Difference]: Start difference. First operand 2049 states and 2624 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) [2021-12-22 16:07:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:38,762 INFO L93 Difference]: Finished difference Result 6752 states and 9308 transitions. [2021-12-22 16:07:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:07:38,762 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 [2021-12-22 16:07:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:38,786 INFO L225 Difference]: With dead ends: 6752 [2021-12-22 16:07:38,786 INFO L226 Difference]: Without dead ends: 5532 [2021-12-22 16:07:38,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=170, Invalid=647, Unknown=7, NotChecked=168, Total=992 [2021-12-22 16:07:38,793 INFO L933 BasicCegarLoop]: 3201 mSDtfsCounter, 3587 mSDsluCounter, 16640 mSDsCounter, 0 mSdLazyCounter, 3758 mSolverCounterSat, 1173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3908 SdHoareTripleChecker+Valid, 19841 SdHoareTripleChecker+Invalid, 6138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1173 IncrementalHoareTripleChecker+Valid, 3758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:38,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3908 Valid, 19841 Invalid, 6138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1173 Valid, 3758 Invalid, 0 Unknown, 1207 Unchecked, 3.6s Time] [2021-12-22 16:07:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2021-12-22 16:07:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 2127. [2021-12-22 16:07:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1510 states have (on average 1.2748344370860927) internal successors, (1925), 1585 states have internal predecessors, (1925), 406 states have call successors, (406), 182 states have call predecessors, (406), 180 states have return successors, (413), 385 states have call predecessors, (413), 404 states have call successors, (413) [2021-12-22 16:07:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2744 transitions. [2021-12-22 16:07:38,937 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2744 transitions. Word has length 32 [2021-12-22 16:07:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:38,938 INFO L470 AbstractCegarLoop]: Abstraction has 2127 states and 2744 transitions. [2021-12-22 16:07:38,938 INFO L471 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) [2021-12-22 16:07:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2744 transitions. [2021-12-22 16:07:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 16:07:38,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:38,941 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:07:38,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:07:39,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-22 16:07:39,159 INFO L402 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)] === [2021-12-22 16:07:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1407947960, now seen corresponding path program 2 times [2021-12-22 16:07:39,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:39,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249183539] [2021-12-22 16:07:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:39,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:39,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:39,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249183539] [2021-12-22 16:07:39,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249183539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:39,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786063100] [2021-12-22 16:07:39,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:07:39,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:39,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:39,542 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) [2021-12-22 16:07:39,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 16:07:39,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:07:39,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:07:39,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-22 16:07:39,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:07:40,124 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:07:40,126 INFO L387 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 [2021-12-22 16:07:40,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,146 INFO L387 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 [2021-12-22 16:07:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:40,166 INFO L387 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 [2021-12-22 16:07:40,300 INFO L387 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 [2021-12-22 16:07:40,312 INFO L387 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 [2021-12-22 16:07:40,392 INFO L387 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 [2021-12-22 16:07:40,398 INFO L387 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 [2021-12-22 16:07:40,475 INFO L387 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 [2021-12-22 16:07:40,479 INFO L387 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 [2021-12-22 16:07:40,610 INFO L387 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 [2021-12-22 16:07:40,617 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:07:40,618 INFO L387 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 [2021-12-22 16:07:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:40,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:07:44,464 WARN L838 $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))) 20))) is different from false [2021-12-22 16:07:44,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (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)))) (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))) 20))) is different from false [2021-12-22 16:07:44,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= 20 (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 [2021-12-22 16:07:44,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= (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))) 20))) is different from false [2021-12-22 16:07:44,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:07:44,558 INFO L387 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 [2021-12-22 16:07:44,564 INFO L387 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 [2021-12-22 16:07:44,567 INFO L387 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 [2021-12-22 16:07:44,589 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:44,589 INFO L387 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 [2021-12-22 16:07:44,709 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:44,709 INFO L387 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 [2021-12-22 16:07:44,757 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:44,757 INFO L387 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 [2021-12-22 16:07:44,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786063100] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:44,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:07:44,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-22 16:07:44,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6670651] [2021-12-22 16:07:44,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:07:44,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 16:07:44,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 16:07:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=395, Unknown=12, NotChecked=172, Total=650 [2021-12-22 16:07:44,785 INFO L87 Difference]: Start difference. First operand 2127 states and 2744 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) [2021-12-22 16:07:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:47,996 INFO L93 Difference]: Finished difference Result 4532 states and 5854 transitions. [2021-12-22 16:07:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:07:48,002 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 [2021-12-22 16:07:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:48,012 INFO L225 Difference]: With dead ends: 4532 [2021-12-22 16:07:48,012 INFO L226 Difference]: Without dead ends: 3331 [2021-12-22 16:07:48,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=140, Invalid=676, Unknown=12, NotChecked=228, Total=1056 [2021-12-22 16:07:48,016 INFO L933 BasicCegarLoop]: 1526 mSDtfsCounter, 2001 mSDsluCounter, 12368 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 13894 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:48,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2011 Valid, 13894 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 3677 Invalid, 0 Unknown, 4 Unchecked, 2.7s Time] [2021-12-22 16:07:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-12-22 16:07:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2421. [2021-12-22 16:07:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 1736 states have (on average 1.2862903225806452) internal successors, (2233), 1814 states have internal predecessors, (2233), 455 states have call successors, (455), 201 states have call predecessors, (455), 199 states have return successors, (464), 431 states have call predecessors, (464), 453 states have call successors, (464) [2021-12-22 16:07:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 3152 transitions. [2021-12-22 16:07:48,117 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 3152 transitions. Word has length 34 [2021-12-22 16:07:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:48,117 INFO L470 AbstractCegarLoop]: Abstraction has 2421 states and 3152 transitions. [2021-12-22 16:07:48,117 INFO L471 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) [2021-12-22 16:07:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 3152 transitions. [2021-12-22 16:07:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:07:48,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:48,118 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:07:48,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:07:48,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:48,333 INFO L402 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)] === [2021-12-22 16:07:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 663977832, now seen corresponding path program 2 times [2021-12-22 16:07:48,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488757736] [2021-12-22 16:07:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:48,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:48,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488757736] [2021-12-22 16:07:48,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488757736] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349981949] [2021-12-22 16:07:48,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:07:48,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:48,435 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) [2021-12-22 16:07:48,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 16:07:48,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:07:48,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:07:48,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-22 16:07:48,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:07:48,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,967 INFO L387 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 [2021-12-22 16:07:48,980 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:07:48,980 INFO L387 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 [2021-12-22 16:07:48,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:07:48,999 INFO L387 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 [2021-12-22 16:07:49,107 INFO L387 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 [2021-12-22 16:07:49,116 INFO L387 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 [2021-12-22 16:07:49,191 INFO L387 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 [2021-12-22 16:07:49,199 INFO L387 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 [2021-12-22 16:07:49,284 INFO L387 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 [2021-12-22 16:07:49,287 INFO L387 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 [2021-12-22 16:07:49,379 INFO L387 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 [2021-12-22 16:07:49,385 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:07:49,385 INFO L387 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 [2021-12-22 16:07:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:07:49,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:07:52,727 WARN L838 $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 [2021-12-22 16:07:52,735 WARN L838 $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 [2021-12-22 16:07:52,744 WARN L838 $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 [2021-12-22 16:07:52,756 WARN L838 $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 [2021-12-22 16:07:52,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:07:52,793 INFO L387 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 [2021-12-22 16:07:52,800 INFO L387 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 [2021-12-22 16:07:52,805 INFO L387 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 [2021-12-22 16:07:52,840 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:52,841 INFO L387 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 [2021-12-22 16:07:52,952 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:52,953 INFO L387 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 [2021-12-22 16:07:53,008 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:07:53,008 INFO L387 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 [2021-12-22 16:07:53,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349981949] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:53,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:07:53,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2021-12-22 16:07:53,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120150914] [2021-12-22 16:07:53,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:07:53,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 16:07:53,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 16:07:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=291, Unknown=7, NotChecked=148, Total=506 [2021-12-22 16:07:53,030 INFO L87 Difference]: Start difference. First operand 2421 states and 3152 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) [2021-12-22 16:08:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:08:00,422 INFO L93 Difference]: Finished difference Result 8565 states and 11947 transitions. [2021-12-22 16:08:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 16:08:00,422 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 [2021-12-22 16:08:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:08:00,446 INFO L225 Difference]: With dead ends: 8565 [2021-12-22 16:08:00,447 INFO L226 Difference]: Without dead ends: 6780 [2021-12-22 16:08:00,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=158, Invalid=721, Unknown=7, NotChecked=236, Total=1122 [2021-12-22 16:08:00,452 INFO L933 BasicCegarLoop]: 3973 mSDtfsCounter, 3439 mSDsluCounter, 31831 mSDsCounter, 0 mSdLazyCounter, 9190 mSolverCounterSat, 937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3865 SdHoareTripleChecker+Valid, 35804 SdHoareTripleChecker+Invalid, 11586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 9190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1459 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:08:00,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3865 Valid, 35804 Invalid, 11586 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [937 Valid, 9190 Invalid, 0 Unknown, 1459 Unchecked, 6.4s Time] [2021-12-22 16:08:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6780 states. [2021-12-22 16:08:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6780 to 2431. [2021-12-22 16:08:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 1744 states have (on average 1.2855504587155964) internal successors, (2242), 1823 states have internal predecessors, (2242), 456 states have call successors, (456), 202 states have call predecessors, (456), 200 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2021-12-22 16:08:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3163 transitions. [2021-12-22 16:08:00,634 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3163 transitions. Word has length 35 [2021-12-22 16:08:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:08:00,634 INFO L470 AbstractCegarLoop]: Abstraction has 2431 states and 3163 transitions. [2021-12-22 16:08:00,635 INFO L471 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) [2021-12-22 16:08:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3163 transitions. [2021-12-22 16:08:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:08:00,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:08:00,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:08:00,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-22 16:08:00,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:08:00,851 INFO L402 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)] === [2021-12-22 16:08:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:08:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1168508767, now seen corresponding path program 1 times [2021-12-22 16:08:00,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:08:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289796921] [2021-12-22 16:08:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:08:00,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:08:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:08:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 16:08:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:08:00,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:08:00,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289796921] [2021-12-22 16:08:00,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289796921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:08:00,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:08:00,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:08:00,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042267174] [2021-12-22 16:08:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:08:00,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:08:00,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:08:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:08:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:08:00,947 INFO L87 Difference]: Start difference. First operand 2431 states and 3163 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) [2021-12-22 16:08:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:08:01,058 INFO L93 Difference]: Finished difference Result 4633 states and 6040 transitions. [2021-12-22 16:08:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:08:01,058 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 [2021-12-22 16:08:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:08:01,068 INFO L225 Difference]: With dead ends: 4633 [2021-12-22 16:08:01,069 INFO L226 Difference]: Without dead ends: 2431 [2021-12-22 16:08:01,075 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:08:01,076 INFO L933 BasicCegarLoop]: 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 [2021-12-22 16:08:01,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 1178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:08:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2021-12-22 16:08:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2021-12-22 16:08:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 1744 states have (on average 1.2769495412844036) internal successors, (2227), 1823 states have internal predecessors, (2227), 456 states have call successors, (456), 202 states have call predecessors, (456), 200 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2021-12-22 16:08:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3148 transitions. [2021-12-22 16:08:01,241 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3148 transitions. Word has length 36 [2021-12-22 16:08:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:08:01,241 INFO L470 AbstractCegarLoop]: Abstraction has 2431 states and 3148 transitions. [2021-12-22 16:08:01,241 INFO L471 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) [2021-12-22 16:08:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3148 transitions. [2021-12-22 16:08:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:08:01,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:08:01,243 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:08:01,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:08:01,243 INFO L402 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)] === [2021-12-22 16:08:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:08:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash 753319847, now seen corresponding path program 3 times [2021-12-22 16:08:01,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:08:01,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649591000] [2021-12-22 16:08:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:08:01,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:08:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:01,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:08:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:08:01,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:08:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649591000] [2021-12-22 16:08:01,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649591000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:08:01,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828834021] [2021-12-22 16:08:01,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:08:01,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:08:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:08:01,759 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) [2021-12-22 16:08:01,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 16:08:02,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-22 16:08:02,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:08:02,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-22 16:08:02,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:08:02,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,471 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 16:08:02,471 INFO L387 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 [2021-12-22 16:08:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:02,495 INFO L387 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 [2021-12-22 16:08:02,509 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:08:02,509 INFO L387 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 [2021-12-22 16:08:02,636 INFO L387 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 [2021-12-22 16:08:02,645 INFO L387 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 [2021-12-22 16:08:02,719 INFO L387 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 [2021-12-22 16:08:02,728 INFO L387 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 [2021-12-22 16:08:02,806 INFO L387 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 [2021-12-22 16:08:02,812 INFO L387 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 [2021-12-22 16:08:02,889 INFO L387 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 [2021-12-22 16:08:02,891 INFO L387 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 [2021-12-22 16:08:02,990 INFO L387 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 [2021-12-22 16:08:02,996 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:08:02,996 INFO L387 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 [2021-12-22 16:08:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:08:03,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:08:03,759 WARN L838 $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))) 20))) is different from false [2021-12-22 16:08:04,317 WARN L838 $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))) 20))) is different from false [2021-12-22 16:08:04,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= 20 (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 [2021-12-22 16:08:04,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (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)))) (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))) 20))) is different from false [2021-12-22 16:08:04,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= 20 (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 [2021-12-22 16:08:04,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= 20 (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 [2021-12-22 16:08:04,392 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:08:04,392 INFO L387 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 [2021-12-22 16:08:04,397 INFO L387 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 [2021-12-22 16:08:04,400 INFO L387 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 [2021-12-22 16:08:04,427 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:04,427 INFO L387 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 [2021-12-22 16:08:04,550 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:04,550 INFO L387 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 [2021-12-22 16:08:04,597 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:04,597 INFO L387 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 [2021-12-22 16:08:04,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828834021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:08:04,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:08:04,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2021-12-22 16:08:04,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542228883] [2021-12-22 16:08:04,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:08:04,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:08:04,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:08:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:08:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=452, Unknown=8, NotChecked=282, Total=812 [2021-12-22 16:08:04,626 INFO L87 Difference]: Start difference. First operand 2431 states and 3148 transitions. Second operand has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 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) [2021-12-22 16:08:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:08:10,028 INFO L93 Difference]: Finished difference Result 4978 states and 6495 transitions. [2021-12-22 16:08:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:08:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 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 37 [2021-12-22 16:08:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:08:10,051 INFO L225 Difference]: With dead ends: 4978 [2021-12-22 16:08:10,054 INFO L226 Difference]: Without dead ends: 3777 [2021-12-22 16:08:10,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=155, Invalid=853, Unknown=8, NotChecked=390, Total=1406 [2021-12-22 16:08:10,059 INFO L933 BasicCegarLoop]: 1535 mSDtfsCounter, 2329 mSDsluCounter, 19097 mSDsCounter, 0 mSdLazyCounter, 6796 mSolverCounterSat, 1122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 20632 SdHoareTripleChecker+Invalid, 8508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1122 IncrementalHoareTripleChecker+Valid, 6796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 590 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:08:10,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2338 Valid, 20632 Invalid, 8508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1122 Valid, 6796 Invalid, 0 Unknown, 590 Unchecked, 4.6s Time] [2021-12-22 16:08:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2021-12-22 16:08:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 2726. [2021-12-22 16:08:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 1972 states have (on average 1.2854969574036512) internal successors, (2535), 2053 states have internal predecessors, (2535), 504 states have call successors, (504), 221 states have call predecessors, (504), 219 states have return successors, (515), 477 states have call predecessors, (515), 502 states have call successors, (515) [2021-12-22 16:08:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3554 transitions. [2021-12-22 16:08:10,227 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3554 transitions. Word has length 37 [2021-12-22 16:08:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:08:10,229 INFO L470 AbstractCegarLoop]: Abstraction has 2726 states and 3554 transitions. [2021-12-22 16:08:10,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 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) [2021-12-22 16:08:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3554 transitions. [2021-12-22 16:08:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 16:08:10,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:08:10,230 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:08:10,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 16:08:10,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:08:10,443 INFO L402 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)] === [2021-12-22 16:08:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:08:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1845342809, now seen corresponding path program 3 times [2021-12-22 16:08:10,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:08:10,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813050390] [2021-12-22 16:08:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:08:10,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:08:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:10,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:08:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:08:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:08:10,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:08:10,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813050390] [2021-12-22 16:08:10,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813050390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:08:10,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678276592] [2021-12-22 16:08:10,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:08:10,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:08:10,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:08:10,568 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) [2021-12-22 16:08:10,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 16:08:11,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-22 16:08:11,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:08:11,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-22 16:08:11,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:08:11,292 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 16:08:11,292 INFO L387 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 [2021-12-22 16:08:11,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 24 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 [2021-12-22 16:08:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,331 INFO L387 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 [2021-12-22 16:08:11,462 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 16:08:11,462 INFO L387 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 [2021-12-22 16:08:11,469 INFO L387 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 [2021-12-22 16:08:11,536 INFO L387 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 [2021-12-22 16:08:11,546 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 16:08:11,546 INFO L387 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 [2021-12-22 16:08:11,629 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 16:08:11,630 INFO L387 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 [2021-12-22 16:08:11,639 INFO L387 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 [2021-12-22 16:08:11,710 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 16:08:11,710 INFO L387 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 [2021-12-22 16:08:11,713 INFO L387 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 [2021-12-22 16:08:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:08:11,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:08:11,874 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-12-22 16:08:11,875 INFO L387 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 [2021-12-22 16:08:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:08:11,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:08:12,022 WARN L838 $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 [2021-12-22 16:08:12,030 WARN L838 $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 [2021-12-22 16:08:12,053 WARN L838 $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 [2021-12-22 16:08:12,069 WARN L838 $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 [2021-12-22 16:08:12,103 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:08:12,103 INFO L387 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 [2021-12-22 16:08:12,108 INFO L387 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 [2021-12-22 16:08:12,111 INFO L387 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 [2021-12-22 16:08:12,145 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:12,145 INFO L387 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 [2021-12-22 16:08:12,264 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:12,264 INFO L387 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 [2021-12-22 16:08:12,311 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-22 16:08:12,311 INFO L387 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 [2021-12-22 16:08:12,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678276592] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:08:12,329 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:08:12,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2021-12-22 16:08:12,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612055292] [2021-12-22 16:08:12,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:08:12,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 16:08:12,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:08:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 16:08:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=400, Unknown=7, NotChecked=172, Total=650 [2021-12-22 16:08:12,330 INFO L87 Difference]: Start difference. First operand 2726 states and 3554 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)